/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_safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 18:52:32,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 18:52:32,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 18:52:32,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 18:52:32,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 18:52:32,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 18:52:32,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 18:52:32,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 18:52:32,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 18:52:32,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 18:52:32,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 18:52:32,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 18:52:32,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 18:52:32,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 18:52:32,232 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 18:52:32,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 18:52:32,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 18:52:32,232 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 18:52:32,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 18:52:32,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 18:52:32,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 18:52:32,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 18:52:32,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 18:52:32,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 18:52:32,234 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 18:52:32,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 18:52:32,235 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 18:52:32,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 18:52:32,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 18:52:32,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 18:52:32,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:52:32,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 18:52:32,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 18:52:32,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 18:52:32,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 18:52:32,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 18:52:32,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 18:52:32,237 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 18:52:32,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 18:52:32,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 18:52:32,237 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 18:52:32,237 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 18:52:32,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 18:52:32,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 18:52:32,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 18:52:32,434 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 18:52:32,434 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 18:52:32,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i [2023-08-03 18:52:33,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 18:52:33,536 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 18:52:33,537 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i [2023-08-03 18:52:33,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3971063bd/4eacf819d8bd4927a6300928d3287683/FLAGab7c856c0 [2023-08-03 18:52:33,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3971063bd/4eacf819d8bd4927a6300928d3287683 [2023-08-03 18:52:33,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 18:52:33,571 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 18:52:33,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 18:52:33,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 18:52:33,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 18:52:33,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:33,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76021248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33, skipping insertion in model container [2023-08-03 18:52:33,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:33,616 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 18:52:33,717 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_safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i[1039,1052] [2023-08-03 18:52:33,852 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:52:33,861 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 18:52:33,870 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_safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i[1039,1052] [2023-08-03 18:52:33,889 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 18:52:33,890 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 18:52:33,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:52:33,950 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:52:33,950 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:52:33,955 INFO L206 MainTranslator]: Completed translation [2023-08-03 18:52:33,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33 WrapperNode [2023-08-03 18:52:33,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 18:52:33,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 18:52:33,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 18:52:33,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 18:52:33,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:33,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:33,989 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-08-03 18:52:33,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 18:52:33,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 18:52:33,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 18:52:33,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 18:52:33,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:33,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:33,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:33,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:34,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:34,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:34,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:34,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:34,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 18:52:34,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 18:52:34,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 18:52:34,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 18:52:34,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (1/1) ... [2023-08-03 18:52:34,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:52:34,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:52:34,039 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 18:52:34,047 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 18:52:34,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 18:52:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 18:52:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 18:52:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 18:52:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 18:52:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 18:52:34,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 18:52:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 18:52:34,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 18:52:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 18:52:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 18:52:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 18:52:34,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 18:52:34,073 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 18:52:34,159 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 18:52:34,161 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 18:52:34,421 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 18:52:34,479 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 18:52:34,479 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 18:52:34,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:52:34 BoogieIcfgContainer [2023-08-03 18:52:34,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 18:52:34,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 18:52:34,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 18:52:34,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 18:52:34,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 06:52:33" (1/3) ... [2023-08-03 18:52:34,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43501413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:52:34, skipping insertion in model container [2023-08-03 18:52:34,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:52:33" (2/3) ... [2023-08-03 18:52:34,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43501413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:52:34, skipping insertion in model container [2023-08-03 18:52:34,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:52:34" (3/3) ... [2023-08-03 18:52:34,524 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i [2023-08-03 18:52:34,529 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 18:52:34,535 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 18:52:34,535 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 18:52:34,535 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 18:52:34,568 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:52:34,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 100 transitions, 210 flow [2023-08-03 18:52:34,635 INFO L124 PetriNetUnfolderBase]: 14/216 cut-off events. [2023-08-03 18:52:34,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:52:34,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 216 events. 14/216 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 602 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2023-08-03 18:52:34,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 100 transitions, 210 flow [2023-08-03 18:52:34,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 100 transitions, 210 flow [2023-08-03 18:52:34,645 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:52:34,651 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 100 transitions, 210 flow [2023-08-03 18:52:34,653 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 100 transitions, 210 flow [2023-08-03 18:52:34,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 100 transitions, 210 flow [2023-08-03 18:52:34,695 INFO L124 PetriNetUnfolderBase]: 14/216 cut-off events. [2023-08-03 18:52:34,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:52:34,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 216 events. 14/216 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 602 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2023-08-03 18:52:34,697 INFO L119 LiptonReduction]: Number of co-enabled transitions 1312 [2023-08-03 18:52:37,004 INFO L134 LiptonReduction]: Checked pairs total: 2921 [2023-08-03 18:52:37,004 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-08-03 18:52:37,013 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:52:37,019 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;@17356391, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:52:37,020 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 18:52:37,024 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:52:37,024 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 18:52:37,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:52:37,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:52:37,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 18:52:37,025 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 18:52:37,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:52:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash 427661301, now seen corresponding path program 1 times [2023-08-03 18:52:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:52:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517094074] [2023-08-03 18:52:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:37,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:52:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:52:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:52:37,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:52:37,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517094074] [2023-08-03 18:52:37,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517094074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:52:37,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:52:37,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:52:37,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433267650] [2023-08-03 18:52:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:52:37,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:52:37,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:52:37,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:52:37,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:52:37,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191 [2023-08-03 18:52:37,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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 18:52:37,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:52:37,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191 [2023-08-03 18:52:37,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:52:37,315 INFO L124 PetriNetUnfolderBase]: 225/439 cut-off events. [2023-08-03 18:52:37,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:52:37,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 439 events. 225/439 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1824 event pairs, 96 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 844. Up to 398 conditions per place. [2023-08-03 18:52:37,320 INFO L140 encePairwiseOnDemand]: 187/191 looper letters, 21 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-03 18:52:37,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 108 flow [2023-08-03 18:52:37,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:52:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:52:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-08-03 18:52:37,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48342059336823734 [2023-08-03 18:52:37,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-08-03 18:52:37,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-08-03 18:52:37,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:52:37,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-08-03 18:52:37,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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 18:52:37,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 18:52:37,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 18:52:37,347 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 56 flow. Second operand 3 states and 277 transitions. [2023-08-03 18:52:37,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 108 flow [2023-08-03 18:52:37,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 18:52:37,349 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 62 flow [2023-08-03 18:52:37,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-03 18:52:37,353 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2023-08-03 18:52:37,353 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 62 flow [2023-08-03 18:52:37,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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 18:52:37,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:52:37,354 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 18:52:37,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 18:52:37,354 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 18:52:37,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:52:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash 369456082, now seen corresponding path program 1 times [2023-08-03 18:52:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:52:37,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913386536] [2023-08-03 18:52:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:37,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:52:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:52:37,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:52:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:52:37,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:52:37,395 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:52:37,396 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-03 18:52:37,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 18:52:37,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 18:52:37,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-03 18:52:37,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 18:52:37,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 18:52:37,398 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 18:52:37,399 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 18:52:37,399 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 18:52:37,414 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:52:37,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 116 transitions, 256 flow [2023-08-03 18:52:37,441 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-03 18:52:37,441 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 18:52:37,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 448 events. 30/448 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1896 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 323. Up to 18 conditions per place. [2023-08-03 18:52:37,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 116 transitions, 256 flow [2023-08-03 18:52:37,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 116 transitions, 256 flow [2023-08-03 18:52:37,443 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:52:37,443 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 116 transitions, 256 flow [2023-08-03 18:52:37,444 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 116 transitions, 256 flow [2023-08-03 18:52:37,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 116 transitions, 256 flow [2023-08-03 18:52:37,467 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-03 18:52:37,467 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 18:52:37,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 448 events. 30/448 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1896 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 323. Up to 18 conditions per place. [2023-08-03 18:52:37,472 INFO L119 LiptonReduction]: Number of co-enabled transitions 3068 [2023-08-03 18:52:39,654 INFO L134 LiptonReduction]: Checked pairs total: 7559 [2023-08-03 18:52:39,654 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-03 18:52:39,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:52:39,662 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;@17356391, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:52:39,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 18:52:39,667 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:52:39,667 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 18:52:39,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:52:39,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:52:39,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 18:52:39,667 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 18:52:39,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:52:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash 646226708, now seen corresponding path program 1 times [2023-08-03 18:52:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:52:39,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473891275] [2023-08-03 18:52:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:39,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:52:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:52:39,716 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 18:52:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:52:39,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473891275] [2023-08-03 18:52:39,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473891275] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:52:39,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:52:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:52:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673682310] [2023-08-03 18:52:39,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:52:39,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:52:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:52:39,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:52:39,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:52:39,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-08-03 18:52:39,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 18:52:39,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:52:39,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-08-03 18:52:39,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:52:41,075 INFO L124 PetriNetUnfolderBase]: 11578/16897 cut-off events. [2023-08-03 18:52:41,075 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2023-08-03 18:52:41,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33385 conditions, 16897 events. 11578/16897 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 100488 event pairs, 8296 based on Foata normal form. 0/14033 useless extension candidates. Maximal degree in co-relation 7366. Up to 15955 conditions per place. [2023-08-03 18:52:41,150 INFO L140 encePairwiseOnDemand]: 208/212 looper letters, 31 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-08-03 18:52:41,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 168 flow [2023-08-03 18:52:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:52:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:52:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-08-03 18:52:41,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49842767295597484 [2023-08-03 18:52:41,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-08-03 18:52:41,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-08-03 18:52:41,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:52:41,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-08-03 18:52:41,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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 18:52:41,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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 18:52:41,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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 18:52:41,154 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 94 flow. Second operand 3 states and 317 transitions. [2023-08-03 18:52:41,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 168 flow [2023-08-03 18:52:41,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 164 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 18:52:41,173 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 100 flow [2023-08-03 18:52:41,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-03 18:52:41,174 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2023-08-03 18:52:41,174 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 100 flow [2023-08-03 18:52:41,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 18:52:41,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:52:41,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:52:41,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 18:52:41,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 18:52:41,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:52:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash 27793434, now seen corresponding path program 1 times [2023-08-03 18:52:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:52:41,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824777903] [2023-08-03 18:52:41,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:41,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:52:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:52:41,222 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 18:52:41,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:52:41,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824777903] [2023-08-03 18:52:41,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824777903] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:52:41,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997461830] [2023-08-03 18:52:41,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:41,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:52:41,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:52:41,261 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 18:52:41,266 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 18:52:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:52:41,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 18:52:41,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:52:41,364 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 18:52:41,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:52:41,376 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 18:52:41,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997461830] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:52:41,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:52:41,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 18:52:41,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332202660] [2023-08-03 18:52:41,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:52:41,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:52:41,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:52:41,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:52:41,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:52:41,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 212 [2023-08-03 18:52:41,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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 18:52:41,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:52:41,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 212 [2023-08-03 18:52:41,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:52:42,546 INFO L124 PetriNetUnfolderBase]: 9794/14105 cut-off events. [2023-08-03 18:52:42,546 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-03 18:52:42,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27820 conditions, 14105 events. 9794/14105 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 79706 event pairs, 4556 based on Foata normal form. 4/11821 useless extension candidates. Maximal degree in co-relation 7384. Up to 13225 conditions per place. [2023-08-03 18:52:42,629 INFO L140 encePairwiseOnDemand]: 208/212 looper letters, 36 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-03 18:52:42,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 202 flow [2023-08-03 18:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 18:52:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 18:52:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 413 transitions. [2023-08-03 18:52:42,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48702830188679247 [2023-08-03 18:52:42,630 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 413 transitions. [2023-08-03 18:52:42,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 413 transitions. [2023-08-03 18:52:42,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:52:42,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 413 transitions. [2023-08-03 18:52:42,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 18:52:42,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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 18:52:42,633 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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 18:52:42,633 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 100 flow. Second operand 4 states and 413 transitions. [2023-08-03 18:52:42,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 202 flow [2023-08-03 18:52:42,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:52:42,635 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 118 flow [2023-08-03 18:52:42,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-08-03 18:52:42,636 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-08-03 18:52:42,636 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 118 flow [2023-08-03 18:52:42,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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 18:52:42,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:52:42,636 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 18:52:42,659 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 18:52:42,842 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 18:52:42,842 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 18:52:42,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:52:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash 832283594, now seen corresponding path program 1 times [2023-08-03 18:52:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:52:42,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057614796] [2023-08-03 18:52:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:52:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:52:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:52:42,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:52:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057614796] [2023-08-03 18:52:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057614796] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:52:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389131746] [2023-08-03 18:52:42,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:42,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:52:42,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:52:42,945 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 18:52:42,982 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 18:52:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:52:43,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 18:52:43,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:52:43,035 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 18:52:43,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 18:52:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389131746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:52:43,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 18:52:43,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 18:52:43,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258651209] [2023-08-03 18:52:43,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:52:43,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:52:43,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:52:43,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:52:43,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 18:52:43,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 212 [2023-08-03 18:52:43,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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 18:52:43,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:52:43,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 212 [2023-08-03 18:52:43,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:52:43,986 INFO L124 PetriNetUnfolderBase]: 9770/14061 cut-off events. [2023-08-03 18:52:43,986 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2023-08-03 18:52:44,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27788 conditions, 14061 events. 9770/14061 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 79508 event pairs, 4544 based on Foata normal form. 16/11789 useless extension candidates. Maximal degree in co-relation 7361. Up to 13224 conditions per place. [2023-08-03 18:52:44,053 INFO L140 encePairwiseOnDemand]: 209/212 looper letters, 36 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-08-03 18:52:44,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 44 transitions, 208 flow [2023-08-03 18:52:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 18:52:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 18:52:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-08-03 18:52:44,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47641509433962265 [2023-08-03 18:52:44,055 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-08-03 18:52:44,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-08-03 18:52:44,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:52:44,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-08-03 18:52:44,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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 18:52:44,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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 18:52:44,058 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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 18:52:44,058 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 118 flow. Second operand 5 states and 505 transitions. [2023-08-03 18:52:44,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 44 transitions, 208 flow [2023-08-03 18:52:44,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 201 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 18:52:44,059 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 107 flow [2023-08-03 18:52:44,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2023-08-03 18:52:44,060 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-08-03 18:52:44,060 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 107 flow [2023-08-03 18:52:44,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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 18:52:44,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:52:44,061 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:52:44,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 18:52:44,265 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 18:52:44,266 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 18:52:44,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:52:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash 960746849, now seen corresponding path program 1 times [2023-08-03 18:52:44,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:52:44,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597446387] [2023-08-03 18:52:44,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:44,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:52:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:52:44,371 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 18:52:44,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:52:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597446387] [2023-08-03 18:52:44,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597446387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:52:44,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:52:44,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 18:52:44,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402742906] [2023-08-03 18:52:44,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:52:44,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:52:44,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:52:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:52:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:52:44,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 212 [2023-08-03 18:52:44,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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 18:52:44,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:52:44,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 212 [2023-08-03 18:52:44,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:52:45,304 INFO L124 PetriNetUnfolderBase]: 8362/12141 cut-off events. [2023-08-03 18:52:45,305 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2023-08-03 18:52:45,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23903 conditions, 12141 events. 8362/12141 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 68357 event pairs, 1642 based on Foata normal form. 0/10493 useless extension candidates. Maximal degree in co-relation 6333. Up to 10529 conditions per place. [2023-08-03 18:52:45,371 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 41 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-08-03 18:52:45,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 230 flow [2023-08-03 18:52:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:52:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:52:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-03 18:52:45,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5283018867924528 [2023-08-03 18:52:45,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-03 18:52:45,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-03 18:52:45,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:52:45,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-03 18:52:45,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 18:52:45,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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 18:52:45,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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 18:52:45,374 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 107 flow. Second operand 3 states and 336 transitions. [2023-08-03 18:52:45,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 230 flow [2023-08-03 18:52:45,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 225 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 18:52:45,376 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 123 flow [2023-08-03 18:52:45,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-08-03 18:52:45,376 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-08-03 18:52:45,377 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 123 flow [2023-08-03 18:52:45,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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 18:52:45,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:52:45,377 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:52:45,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 18:52:45,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 18:52:45,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:52:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash 960748545, now seen corresponding path program 1 times [2023-08-03 18:52:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:52:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098859266] [2023-08-03 18:52:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:52:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:52:45,408 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 18:52:45,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:52:45,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098859266] [2023-08-03 18:52:45,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098859266] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:52:45,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:52:45,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 18:52:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221065303] [2023-08-03 18:52:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:52:45,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:52:45,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:52:45,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:52:45,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:52:45,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-08-03 18:52:45,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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 18:52:45,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:52:45,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-08-03 18:52:45,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:52:46,188 INFO L124 PetriNetUnfolderBase]: 8266/11837 cut-off events. [2023-08-03 18:52:46,189 INFO L125 PetriNetUnfolderBase]: For 1014/1014 co-relation queries the response was YES. [2023-08-03 18:52:46,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25500 conditions, 11837 events. 8266/11837 cut-off events. For 1014/1014 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 65868 event pairs, 6266 based on Foata normal form. 0/10301 useless extension candidates. Maximal degree in co-relation 6725. Up to 11017 conditions per place. [2023-08-03 18:52:46,248 INFO L140 encePairwiseOnDemand]: 209/212 looper letters, 40 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-03 18:52:46,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 232 flow [2023-08-03 18:52:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:52:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:52:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-08-03 18:52:46,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062893081761006 [2023-08-03 18:52:46,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-08-03 18:52:46,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-08-03 18:52:46,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:52:46,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-08-03 18:52:46,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states 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 18:52:46,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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 18:52:46,251 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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 18:52:46,251 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 123 flow. Second operand 3 states and 322 transitions. [2023-08-03 18:52:46,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 232 flow [2023-08-03 18:52:46,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:52:46,256 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 132 flow [2023-08-03 18:52:46,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-03 18:52:46,256 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2023-08-03 18:52:46,256 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 132 flow [2023-08-03 18:52:46,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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 18:52:46,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:52:46,257 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:52:46,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 18:52:46,257 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 18:52:46,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:52:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1662126146, now seen corresponding path program 1 times [2023-08-03 18:52:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:52:46,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349014761] [2023-08-03 18:52:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:46,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:52:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:52:46,300 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 18:52:46,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:52:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349014761] [2023-08-03 18:52:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349014761] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:52:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788214679] [2023-08-03 18:52:46,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:46,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:52:46,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:52:46,318 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 18:52:46,330 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 18:52:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:52:46,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 18:52:46,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:52:46,409 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 18:52:46,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:52:46,421 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 18:52:46,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788214679] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:52:46,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:52:46,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 18:52:46,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748377888] [2023-08-03 18:52:46,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:52:46,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:52:46,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:52:46,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:52:46,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:52:46,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 212 [2023-08-03 18:52:46,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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 18:52:46,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:52:46,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 212 [2023-08-03 18:52:46,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:52:47,258 INFO L124 PetriNetUnfolderBase]: 7690/10717 cut-off events. [2023-08-03 18:52:47,258 INFO L125 PetriNetUnfolderBase]: For 1598/1598 co-relation queries the response was YES. [2023-08-03 18:52:47,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23997 conditions, 10717 events. 7690/10717 cut-off events. For 1598/1598 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 56603 event pairs, 3034 based on Foata normal form. 64/9725 useless extension candidates. Maximal degree in co-relation 6317. Up to 7209 conditions per place. [2023-08-03 18:52:47,312 INFO L140 encePairwiseOnDemand]: 208/212 looper letters, 55 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-03 18:52:47,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 318 flow [2023-08-03 18:52:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 18:52:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 18:52:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2023-08-03 18:52:47,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035377358490566 [2023-08-03 18:52:47,314 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2023-08-03 18:52:47,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2023-08-03 18:52:47,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:52:47,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2023-08-03 18:52:47,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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 18:52:47,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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 18:52:47,316 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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 18:52:47,316 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 132 flow. Second operand 4 states and 427 transitions. [2023-08-03 18:52:47,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 318 flow [2023-08-03 18:52:47,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:52:47,320 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 150 flow [2023-08-03 18:52:47,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-08-03 18:52:47,321 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2023-08-03 18:52:47,321 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 150 flow [2023-08-03 18:52:47,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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 18:52:47,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:52:47,321 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:52:47,337 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 18:52:47,526 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 18:52:47,526 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 18:52:47,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:52:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1422569966, now seen corresponding path program 1 times [2023-08-03 18:52:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:52:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373178761] [2023-08-03 18:52:47,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:52:47,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:52:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:52:47,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:52:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:52:47,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:52:47,570 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:52:47,570 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-03 18:52:47,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 18:52:47,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 18:52:47,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 18:52:47,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 18:52:47,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 18:52:47,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 18:52:47,571 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:52:47,574 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 18:52:47,574 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 18:52:47,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 06:52:47 BasicIcfg [2023-08-03 18:52:47,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 18:52:47,634 INFO L158 Benchmark]: Toolchain (without parser) took 14062.34ms. Allocated memory was 356.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 317.4MB in the beginning and 984.4MB in the end (delta: -667.0MB). Peak memory consumption was 621.0MB. Max. memory is 16.0GB. [2023-08-03 18:52:47,634 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 356.5MB. Free memory is still 312.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 18:52:47,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.71ms. Allocated memory is still 356.5MB. Free memory was 317.4MB in the beginning and 294.9MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 18:52:47,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.50ms. Allocated memory is still 356.5MB. Free memory was 294.9MB in the beginning and 292.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 18:52:47,635 INFO L158 Benchmark]: Boogie Preprocessor took 20.81ms. Allocated memory is still 356.5MB. Free memory was 292.4MB in the beginning and 290.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 18:52:47,635 INFO L158 Benchmark]: RCFGBuilder took 468.67ms. Allocated memory is still 356.5MB. Free memory was 290.5MB in the beginning and 260.3MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-03 18:52:47,635 INFO L158 Benchmark]: TraceAbstraction took 13127.96ms. Allocated memory was 471.9MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 443.3MB in the beginning and 984.4MB in the end (delta: -541.2MB). Peak memory consumption was 629.0MB. Max. memory is 16.0GB. [2023-08-03 18:52:47,636 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 312.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 382.71ms. Allocated memory is still 356.5MB. Free memory was 317.4MB in the beginning and 294.9MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.50ms. Allocated memory is still 356.5MB. Free memory was 294.9MB in the beginning and 292.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.81ms. Allocated memory is still 356.5MB. Free memory was 292.4MB in the beginning and 290.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 468.67ms. Allocated memory is still 356.5MB. Free memory was 290.5MB in the beginning and 260.3MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 13127.96ms. Allocated memory was 471.9MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 443.3MB in the beginning and 984.4MB in the end (delta: -541.2MB). Peak memory consumption was 629.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 101 PlacesBefore, 27 PlacesAfterwards, 100 TransitionsBefore, 23 TransitionsAfterwards, 1312 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, 2921 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1612, independent: 1509, independent conditional: 0, independent unconditional: 1509, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 743, independent: 716, independent conditional: 0, independent unconditional: 716, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1612, independent: 793, independent conditional: 0, independent unconditional: 793, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 743, unknown conditional: 0, unknown unconditional: 743] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 121 PlacesBefore, 43 PlacesAfterwards, 116 TransitionsBefore, 35 TransitionsAfterwards, 3068 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 96 TotalNumberOfCompositions, 7559 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3134, independent: 2963, independent conditional: 0, independent unconditional: 2963, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1563, independent: 1517, independent conditional: 0, independent unconditional: 1517, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3134, independent: 1446, independent conditional: 0, independent unconditional: 1446, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1563, unknown conditional: 0, unknown unconditional: 1563] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561[2]; [L804] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2561={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] [L804] COND TRUE 0 asdf<2 [L804] FCALL, FORK 0 pthread_create(&t2561[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2561[asdf], ((void *)0), P0, ((void *)0))=-3, t2561={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] [L804] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2561={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] [L804] COND TRUE 0 asdf<2 [L804] FCALL, FORK 0 pthread_create(&t2561[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2561[asdf], ((void *)0), P0, ((void *)0))=-2, t2561={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] [L804] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2561={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] [L804] COND FALSE 0 !(asdf<2) [L805] 0 pthread_t t2562[2]; [L806] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2561={5:0}, t2562={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] [L806] COND TRUE 0 asdf<2 [L806] FCALL, FORK 0 pthread_create(&t2562[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2562[asdf], ((void *)0), P1, ((void *)0))=-1, t2561={5:0}, t2562={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] [L767] 3 x$w_buff1 = x$w_buff0 [L768] 3 x$w_buff0 = 1 [L769] 3 x$w_buff1_used = x$w_buff0_used [L770] 3 x$w_buff0_used = (_Bool)1 [L771] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L771] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L806] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2561={5:0}, t2562={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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L806] COND TRUE 0 asdf<2 [L806] FCALL, FORK 0 pthread_create(&t2562[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2562[asdf], ((void *)0), P1, ((void *)0))=0, t2561={5:0}, t2562={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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 4 x$w_buff1 = x$w_buff0 [L768] 4 x$w_buff0 = 1 [L769] 4 x$w_buff1_used = x$w_buff0_used [L770] 4 x$w_buff0_used = (_Bool)1 [L771] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x=0, y=0] - UnprovableResult [Line: 19]: 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: 804]: 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: 806]: 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, 113 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: 2.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 44 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=62occurred 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, 129 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.2s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 466 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 3 mSDtfsCounter, 466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred 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.3s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 41/52 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 18:52:47,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...