/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix022_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:16:56,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:16:56,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:16:56,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:16:56,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:16:56,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:16:56,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:16:57,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:16:57,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:16:57,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:16:57,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:16:57,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:16:57,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:16:57,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:16:57,008 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:16:57,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:16:57,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:16:57,009 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:16:57,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:16:57,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:16:57,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:16:57,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:16:57,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:16:57,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:16:57,010 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:16:57,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:16:57,011 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:16:57,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:16:57,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:16:57,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:16:57,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:16:57,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:16:57,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:16:57,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:16:57,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:16:57,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:16:57,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:16:57,013 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:16:57,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:16:57,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:16:57,014 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:16:57,014 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> TOGETHER [2023-08-03 17:16:57,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:16:57,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:16:57,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:16:57,203 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:16:57,203 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:16:57,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix022_tso_bound2.i [2023-08-03 17:16:58,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:16:58,453 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:16:58,453 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix022_tso_bound2.i [2023-08-03 17:16:58,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b602522a8/9851e2bbb88f406a962d222722711b5c/FLAG4688c1cae [2023-08-03 17:16:58,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b602522a8/9851e2bbb88f406a962d222722711b5c [2023-08-03 17:16:58,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:16:58,484 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:16:58,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:16:58,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:16:58,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:16:58,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b8768b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58, skipping insertion in model container [2023-08-03 17:16:58,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,525 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:16:58,618 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix022_tso_bound2.i[944,957] [2023-08-03 17:16:58,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:16:58,765 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:16:58,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix022_tso_bound2.i[944,957] [2023-08-03 17:16:58,778 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:16:58,779 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:16:58,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:16:58,830 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:16:58,830 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:16:58,835 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:16:58,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58 WrapperNode [2023-08-03 17:16:58,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:16:58,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:16:58,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:16:58,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:16:58,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,888 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-03 17:16:58,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:16:58,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:16:58,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:16:58,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:16:58,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:16:58,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:16:58,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:16:58,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:16:58,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (1/1) ... [2023-08-03 17:16:58,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:16:58,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:16:58,949 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-03 17:16:58,951 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-03 17:16:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:16:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:16:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:16:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:16:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:16:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:16:58,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:16:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:16:58,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:16:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:16:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:16:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:16:58,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:16:58,979 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 17:16:59,065 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:16:59,066 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:16:59,313 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:16:59,417 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:16:59,418 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 17:16:59,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:16:59 BoogieIcfgContainer [2023-08-03 17:16:59,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:16:59,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:16:59,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:16:59,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:16:59,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:16:58" (1/3) ... [2023-08-03 17:16:59,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f924345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:16:59, skipping insertion in model container [2023-08-03 17:16:59,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:16:58" (2/3) ... [2023-08-03 17:16:59,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f924345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:16:59, skipping insertion in model container [2023-08-03 17:16:59,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:16:59" (3/3) ... [2023-08-03 17:16:59,429 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix022_tso_bound2.i [2023-08-03 17:16:59,436 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:16:59,443 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:16:59,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:16:59,444 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:16:59,484 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:16:59,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 216 flow [2023-08-03 17:16:59,577 INFO L124 PetriNetUnfolderBase]: 14/220 cut-off events. [2023-08-03 17:16:59,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:16:59,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 220 events. 14/220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 614 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-03 17:16:59,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 103 transitions, 216 flow [2023-08-03 17:16:59,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 103 transitions, 216 flow [2023-08-03 17:16:59,595 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:16:59,611 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 103 transitions, 216 flow [2023-08-03 17:16:59,614 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 103 transitions, 216 flow [2023-08-03 17:16:59,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 216 flow [2023-08-03 17:16:59,672 INFO L124 PetriNetUnfolderBase]: 14/220 cut-off events. [2023-08-03 17:16:59,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:16:59,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 220 events. 14/220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 614 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-03 17:16:59,675 INFO L119 LiptonReduction]: Number of co-enabled transitions 1520 [2023-08-03 17:17:02,425 INFO L134 LiptonReduction]: Checked pairs total: 4109 [2023-08-03 17:17:02,425 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-03 17:17:02,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:17:02,447 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=true, 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;@23536a4a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:17:02,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 17:17:02,449 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:17:02,450 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-03 17:17:02,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:17:02,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:02,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:17:02,450 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 17:17:02,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash 479203248, now seen corresponding path program 1 times [2023-08-03 17:17:02,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:02,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198598849] [2023-08-03 17:17:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:02,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:02,662 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-03 17:17:02,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:17:02,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198598849] [2023-08-03 17:17:02,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198598849] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:17:02,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:17:02,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:17:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265888853] [2023-08-03 17:17:02,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:17:02,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:17:02,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:17:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:17:02,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:17:02,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 196 [2023-08-03 17:17:02,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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-03 17:17:02,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:17:02,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 196 [2023-08-03 17:17:02,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:17:02,835 INFO L124 PetriNetUnfolderBase]: 270/511 cut-off events. [2023-08-03 17:17:02,835 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-03 17:17:02,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 511 events. 270/511 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2246 event pairs, 218 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 991. Up to 471 conditions per place. [2023-08-03 17:17:02,841 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 22 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-08-03 17:17:02,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 114 flow [2023-08-03 17:17:02,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:17:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:17:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-03 17:17:02,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-03 17:17:02,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-03 17:17:02,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-03 17:17:02,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:17:02,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-03 17:17:02,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 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-03 17:17:02,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 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-03 17:17:02,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 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-03 17:17:02,868 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 58 flow. Second operand 3 states and 280 transitions. [2023-08-03 17:17:02,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 114 flow [2023-08-03 17:17:02,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:17:02,871 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 66 flow [2023-08-03 17:17:02,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-03 17:17:02,875 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-08-03 17:17:02,875 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 66 flow [2023-08-03 17:17:02,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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-03 17:17:02,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:02,875 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:17:02,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:17:02,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 17:17:02,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1978012655, now seen corresponding path program 1 times [2023-08-03 17:17:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:02,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896132830] [2023-08-03 17:17:02,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:17:02,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:17:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:17:02,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:17:02,951 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:17:02,952 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-03 17:17:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 17:17:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 17:17:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-03 17:17:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 17:17:02,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:17:02,954 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:17:02,955 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:17:02,955 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:17:02,978 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:17:02,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 121 transitions, 266 flow [2023-08-03 17:17:03,014 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-03 17:17:03,015 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:17:03,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 457 events. 30/457 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1943 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 329. Up to 18 conditions per place. [2023-08-03 17:17:03,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 121 transitions, 266 flow [2023-08-03 17:17:03,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 121 transitions, 266 flow [2023-08-03 17:17:03,018 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:17:03,018 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 121 transitions, 266 flow [2023-08-03 17:17:03,018 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 121 transitions, 266 flow [2023-08-03 17:17:03,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 121 transitions, 266 flow [2023-08-03 17:17:03,047 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-03 17:17:03,047 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:17:03,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 457 events. 30/457 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1943 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 329. Up to 18 conditions per place. [2023-08-03 17:17:03,052 INFO L119 LiptonReduction]: Number of co-enabled transitions 3612 [2023-08-03 17:17:05,511 INFO L134 LiptonReduction]: Checked pairs total: 10826 [2023-08-03 17:17:05,511 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-03 17:17:05,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:17:05,514 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=true, 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;@23536a4a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:17:05,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:17:05,515 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:17:05,515 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-03 17:17:05,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:17:05,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:05,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:17:05,516 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:17:05,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash 705409838, now seen corresponding path program 1 times [2023-08-03 17:17:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:05,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321536665] [2023-08-03 17:17:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:05,546 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-03 17:17:05,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:17:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321536665] [2023-08-03 17:17:05,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321536665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:17:05,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:17:05,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:17:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860527241] [2023-08-03 17:17:05,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:17:05,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:17:05,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:17:05,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:17:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:17:05,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 219 [2023-08-03 17:17:05,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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-03 17:17:05,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:17:05,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 219 [2023-08-03 17:17:05,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:17:07,805 INFO L124 PetriNetUnfolderBase]: 16566/23830 cut-off events. [2023-08-03 17:17:07,806 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2023-08-03 17:17:07,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47086 conditions, 23830 events. 16566/23830 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 149647 event pairs, 12024 based on Foata normal form. 0/20202 useless extension candidates. Maximal degree in co-relation 10378. Up to 22623 conditions per place. [2023-08-03 17:17:07,914 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 33 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-03 17:17:07,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 180 flow [2023-08-03 17:17:07,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:17:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:17:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-03 17:17:07,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931506849315068 [2023-08-03 17:17:07,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-03 17:17:07,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-03 17:17:07,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:17:07,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-03 17:17:07,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-03 17:17:07,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-03 17:17:07,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-03 17:17:07,920 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 100 flow. Second operand 3 states and 324 transitions. [2023-08-03 17:17:07,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 180 flow [2023-08-03 17:17:07,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 176 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 17:17:07,924 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 108 flow [2023-08-03 17:17:07,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-03 17:17:07,924 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2023-08-03 17:17:07,925 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 108 flow [2023-08-03 17:17:07,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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-03 17:17:07,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:07,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:17:07,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:17:07,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:17:07,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash 734455631, now seen corresponding path program 1 times [2023-08-03 17:17:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:07,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813158443] [2023-08-03 17:17:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:07,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:17:08,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:17:08,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813158443] [2023-08-03 17:17:08,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813158443] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:17:08,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281742659] [2023-08-03 17:17:08,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:08,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:17:08,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:17:08,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:17:08,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 17:17:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:08,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 17:17:08,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:17:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 17:17:08,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:17:08,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281742659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:17:08,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:17:08,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 17:17:08,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211715658] [2023-08-03 17:17:08,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:17:08,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:17:08,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:17:08,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:17:08,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:17:08,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 219 [2023-08-03 17:17:08,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-03 17:17:08,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:17:08,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 219 [2023-08-03 17:17:08,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:17:10,166 INFO L124 PetriNetUnfolderBase]: 16458/23606 cut-off events. [2023-08-03 17:17:10,166 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2023-08-03 17:17:10,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46636 conditions, 23606 events. 16458/23606 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 147706 event pairs, 11442 based on Foata normal form. 0/20066 useless extension candidates. Maximal degree in co-relation 46595. Up to 22065 conditions per place. [2023-08-03 17:17:10,258 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 42 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-03 17:17:10,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 222 flow [2023-08-03 17:17:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:17:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:17:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-08-03 17:17:10,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053272450532724 [2023-08-03 17:17:10,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-08-03 17:17:10,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-08-03 17:17:10,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:17:10,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-08-03 17:17:10,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-03 17:17:10,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-03 17:17:10,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-03 17:17:10,263 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 108 flow. Second operand 3 states and 332 transitions. [2023-08-03 17:17:10,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 222 flow [2023-08-03 17:17:10,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:17:10,264 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 118 flow [2023-08-03 17:17:10,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-03 17:17:10,265 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2023-08-03 17:17:10,265 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 118 flow [2023-08-03 17:17:10,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-03 17:17:10,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:10,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:17:10,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 17:17:10,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:17:10,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:17:10,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:10,470 INFO L85 PathProgramCache]: Analyzing trace with hash 734443214, now seen corresponding path program 1 times [2023-08-03 17:17:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:10,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405049736] [2023-08-03 17:17:10,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:10,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:17:10,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:17:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405049736] [2023-08-03 17:17:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405049736] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:17:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469096943] [2023-08-03 17:17:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:10,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:17:10,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:17:10,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:17:10,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 17:17:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:10,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:17:10,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:17:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:17:10,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:17:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:17:10,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469096943] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:17:10,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:17:10,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-03 17:17:10,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111152522] [2023-08-03 17:17:10,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:17:10,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 17:17:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:17:10,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 17:17:10,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 17:17:10,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 219 [2023-08-03 17:17:10,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:10,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:17:10,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 219 [2023-08-03 17:17:10,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:17:12,473 INFO L124 PetriNetUnfolderBase]: 13890/19602 cut-off events. [2023-08-03 17:17:12,473 INFO L125 PetriNetUnfolderBase]: For 1548/1548 co-relation queries the response was YES. [2023-08-03 17:17:12,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40210 conditions, 19602 events. 13890/19602 cut-off events. For 1548/1548 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 116379 event pairs, 6732 based on Foata normal form. 4/17446 useless extension candidates. Maximal degree in co-relation 10632. Up to 18601 conditions per place. [2023-08-03 17:17:12,577 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 39 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2023-08-03 17:17:12,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 226 flow [2023-08-03 17:17:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:17:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:17:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-08-03 17:17:12,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828767123287671 [2023-08-03 17:17:12,579 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-08-03 17:17:12,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-08-03 17:17:12,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:17:12,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-08-03 17:17:12,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-03 17:17:12,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-03 17:17:12,582 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-03 17:17:12,582 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 118 flow. Second operand 4 states and 423 transitions. [2023-08-03 17:17:12,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 226 flow [2023-08-03 17:17:12,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:17:12,583 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 136 flow [2023-08-03 17:17:12,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-03 17:17:12,584 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2023-08-03 17:17:12,584 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 136 flow [2023-08-03 17:17:12,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:12,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:12,584 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:17:12,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 17:17:12,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:17:12,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:17:12,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:12,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1560892052, now seen corresponding path program 1 times [2023-08-03 17:17:12,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:12,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146553362] [2023-08-03 17:17:12,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:12,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:17:12,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:17:12,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146553362] [2023-08-03 17:17:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146553362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:17:12,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:17:12,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 17:17:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997086793] [2023-08-03 17:17:12,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:17:12,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:17:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:17:12,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:17:12,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:17:12,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 219 [2023-08-03 17:17:12,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-03 17:17:12,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:17:12,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 219 [2023-08-03 17:17:12,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:17:14,458 INFO L124 PetriNetUnfolderBase]: 13866/19554 cut-off events. [2023-08-03 17:17:14,458 INFO L125 PetriNetUnfolderBase]: For 1628/1628 co-relation queries the response was YES. [2023-08-03 17:17:14,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40082 conditions, 19554 events. 13866/19554 cut-off events. For 1628/1628 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 116109 event pairs, 6720 based on Foata normal form. 16/17410 useless extension candidates. Maximal degree in co-relation 10595. Up to 18600 conditions per place. [2023-08-03 17:17:14,545 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 39 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-08-03 17:17:14,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 232 flow [2023-08-03 17:17:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:17:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:17:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2023-08-03 17:17:14,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47214611872146117 [2023-08-03 17:17:14,547 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 517 transitions. [2023-08-03 17:17:14,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 517 transitions. [2023-08-03 17:17:14,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:17:14,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 517 transitions. [2023-08-03 17:17:14,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 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-03 17:17:14,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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-03 17:17:14,550 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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-03 17:17:14,550 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 136 flow. Second operand 5 states and 517 transitions. [2023-08-03 17:17:14,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 232 flow [2023-08-03 17:17:14,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 225 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:17:14,552 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 125 flow [2023-08-03 17:17:14,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2023-08-03 17:17:14,553 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2023-08-03 17:17:14,553 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 125 flow [2023-08-03 17:17:14,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-03 17:17:14,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:14,553 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:17:14,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:17:14,554 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:17:14,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:14,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1073554863, now seen corresponding path program 1 times [2023-08-03 17:17:14,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:14,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195979930] [2023-08-03 17:17:14,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:14,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:17:14,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:17:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195979930] [2023-08-03 17:17:14,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195979930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:17:14,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:17:14,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:17:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037917876] [2023-08-03 17:17:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:17:14,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:17:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:17:14,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:17:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:17:14,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 219 [2023-08-03 17:17:14,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 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-03 17:17:14,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:17:14,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 219 [2023-08-03 17:17:14,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:17:16,117 INFO L124 PetriNetUnfolderBase]: 12458/17543 cut-off events. [2023-08-03 17:17:16,117 INFO L125 PetriNetUnfolderBase]: For 1347/1347 co-relation queries the response was YES. [2023-08-03 17:17:16,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35962 conditions, 17543 events. 12458/17543 cut-off events. For 1347/1347 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 102632 event pairs, 3162 based on Foata normal form. 0/15927 useless extension candidates. Maximal degree in co-relation 16853. Up to 16065 conditions per place. [2023-08-03 17:17:16,180 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 45 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-03 17:17:16,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 264 flow [2023-08-03 17:17:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:17:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:17:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-08-03 17:17:16,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5235920852359208 [2023-08-03 17:17:16,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-08-03 17:17:16,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-08-03 17:17:16,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:17:16,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-08-03 17:17:16,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-03 17:17:16,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-03 17:17:16,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-03 17:17:16,184 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 125 flow. Second operand 3 states and 344 transitions. [2023-08-03 17:17:16,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 264 flow [2023-08-03 17:17:16,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 259 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:17:16,185 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 141 flow [2023-08-03 17:17:16,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-03 17:17:16,186 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2023-08-03 17:17:16,186 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 141 flow [2023-08-03 17:17:16,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 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-03 17:17:16,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:16,186 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:17:16,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:17:16,186 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:17:16,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash 138675704, now seen corresponding path program 1 times [2023-08-03 17:17:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:16,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007672986] [2023-08-03 17:17:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:17:16,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:17:16,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007672986] [2023-08-03 17:17:16,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007672986] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:17:16,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828791056] [2023-08-03 17:17:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:16,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:17:16,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:17:16,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:17:16,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 17:17:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:16,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:17:16,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:17:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:17:16,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:17:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:17:16,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828791056] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:17:16,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:17:16,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 17:17:16,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170236748] [2023-08-03 17:17:16,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:17:16,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:17:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:17:16,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:17:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:17:16,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 219 [2023-08-03 17:17:16,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:16,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:17:16,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 219 [2023-08-03 17:17:16,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:17:17,666 INFO L124 PetriNetUnfolderBase]: 11722/16135 cut-off events. [2023-08-03 17:17:17,667 INFO L125 PetriNetUnfolderBase]: For 2007/2007 co-relation queries the response was YES. [2023-08-03 17:17:17,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35815 conditions, 16135 events. 11722/16135 cut-off events. For 2007/2007 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 91046 event pairs, 4546 based on Foata normal form. 80/14791 useless extension candidates. Maximal degree in co-relation 16861. Up to 11009 conditions per place. [2023-08-03 17:17:17,727 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 60 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-03 17:17:17,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 346 flow [2023-08-03 17:17:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:17:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:17:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-03 17:17:17,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502283105022831 [2023-08-03 17:17:17,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-03 17:17:17,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-03 17:17:17,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:17:17,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-03 17:17:17,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-03 17:17:17,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-03 17:17:17,731 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-03 17:17:17,731 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 141 flow. Second operand 4 states and 440 transitions. [2023-08-03 17:17:17,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 346 flow [2023-08-03 17:17:17,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:17:17,734 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 158 flow [2023-08-03 17:17:17,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-08-03 17:17:17,735 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2023-08-03 17:17:17,735 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 158 flow [2023-08-03 17:17:17,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:17,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:17,735 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:17:17,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 17:17:17,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:17:17,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:17:17,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash -22164765, now seen corresponding path program 1 times [2023-08-03 17:17:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:17,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285381721] [2023-08-03 17:17:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:17:17,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:17:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:17:17,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:17:17,961 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:17:17,961 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-03 17:17:17,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:17:17,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:17:17,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:17:17,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:17:17,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:17:17,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 17:17:17,962 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:17:17,964 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:17:17,965 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:17:18,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:17:18 BasicIcfg [2023-08-03 17:17:18,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:17:18,017 INFO L158 Benchmark]: Toolchain (without parser) took 19532.92ms. Allocated memory was 356.5MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 316.7MB in the beginning and 3.9GB in the end (delta: -3.6GB). Peak memory consumption was 870.7MB. Max. memory is 16.0GB. [2023-08-03 17:17:18,017 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 356.5MB. Free memory is still 304.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:17:18,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.11ms. Allocated memory is still 356.5MB. Free memory was 316.7MB in the beginning and 292.2MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:17:18,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.37ms. Allocated memory is still 356.5MB. Free memory was 292.2MB in the beginning and 289.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 17:17:18,018 INFO L158 Benchmark]: Boogie Preprocessor took 21.74ms. Allocated memory is still 356.5MB. Free memory was 289.4MB in the beginning and 287.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:17:18,018 INFO L158 Benchmark]: RCFGBuilder took 509.93ms. Allocated memory is still 356.5MB. Free memory was 287.3MB in the beginning and 245.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-03 17:17:18,018 INFO L158 Benchmark]: TraceAbstraction took 18593.80ms. Allocated memory was 356.5MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 244.7MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 799.4MB. Max. memory is 16.0GB. [2023-08-03 17:17:18,019 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.08ms. Allocated memory is still 356.5MB. Free memory is still 304.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 349.11ms. Allocated memory is still 356.5MB. Free memory was 316.7MB in the beginning and 292.2MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.37ms. Allocated memory is still 356.5MB. Free memory was 292.2MB in the beginning and 289.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.74ms. Allocated memory is still 356.5MB. Free memory was 289.4MB in the beginning and 287.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 509.93ms. Allocated memory is still 356.5MB. Free memory was 287.3MB in the beginning and 245.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 18593.80ms. Allocated memory was 356.5MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 244.7MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 799.4MB. 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: 2.8s, 104 PlacesBefore, 29 PlacesAfterwards, 103 TransitionsBefore, 24 TransitionsAfterwards, 1520 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 93 TotalNumberOfCompositions, 4109 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2025, independent: 1872, independent conditional: 0, independent unconditional: 1872, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 823, independent: 793, independent conditional: 0, independent unconditional: 793, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2025, independent: 1079, independent conditional: 0, independent unconditional: 1079, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 823, unknown conditional: 0, unknown unconditional: 823] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 126 PlacesBefore, 47 PlacesAfterwards, 121 TransitionsBefore, 38 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 98 TotalNumberOfCompositions, 10826 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3937, independent: 3706, independent conditional: 0, independent unconditional: 3706, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1792, independent: 1738, independent conditional: 0, independent unconditional: 1738, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3937, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 1792, unknown conditional: 0, unknown unconditional: 1792] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t597[2]; [L811] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] COND TRUE 0 asdf<2 [L811] FCALL, FORK 0 pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0))=-1, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] COND TRUE 0 asdf<2 [L811] FCALL, FORK 0 pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0))=0, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] COND FALSE 0 !(asdf<2) [L812] 0 pthread_t t598[2]; [L813] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L813] COND TRUE 0 asdf<2 [L813] FCALL, FORK 0 pthread_create(&t598[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t598[asdf], ((void *)0), P1, ((void *)0))=1, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 3 x$w_buff1 = x$w_buff0 [L759] 3 x$w_buff0 = 2 [L760] 3 x$w_buff1_used = x$w_buff0_used [L761] 3 x$w_buff0_used = (_Bool)1 [L762] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L762] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L813] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L813] COND TRUE 0 asdf<2 [L813] FCALL, FORK 0 pthread_create(&t598[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t598[asdf], ((void *)0), P1, ((void *)0))=2, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 4 x$w_buff1 = x$w_buff0 [L759] 4 x$w_buff0 = 2 [L760] 4 x$w_buff1_used = x$w_buff0_used [L761] 4 x$w_buff0_used = (_Bool)1 [L762] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=0] - 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: 813]: 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: 811]: 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 5 procedures, 118 locations, 5 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: 3.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.0s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 463 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 3 mSDtfsCounter, 463 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=6, InterpolantAutomatonStates: 22, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 33/40 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-03 17:17:18,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...