/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_mix033_tso.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:25:51,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:25:51,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:25:51,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:25:51,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:25:51,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:25:51,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:25:51,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:25:51,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:25:51,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:25:51,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:25:51,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:25:51,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:25:51,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:25:51,987 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:25:51,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:25:51,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:25:51,992 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:25:51,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:25:51,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:25:51,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:25:51,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:25:51,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:25:51,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:25:51,999 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:25:51,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:25:51,999 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:25:51,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:25:52,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:25:52,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:25:52,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:25:52,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:25:52,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:25:52,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:25:52,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:25:52,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:25:52,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:25:52,002 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:25:52,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:25:52,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:25:52,002 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:25:52,002 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 17:25:52,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:25:52,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:25:52,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:25:52,290 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:25:52,291 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:25:52,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix033_tso.oepc_bound2.i [2023-08-03 17:25:53,448 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:25:53,700 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:25:53,700 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix033_tso.oepc_bound2.i [2023-08-03 17:25:53,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41342a13/6e7c0832a07540869d2eaa0d114095df/FLAGb1a30811c [2023-08-03 17:25:53,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41342a13/6e7c0832a07540869d2eaa0d114095df [2023-08-03 17:25:53,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:25:53,730 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:25:53,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:25:53,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:25:53,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:25:53,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:25:53" (1/1) ... [2023-08-03 17:25:53,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543d1f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:53, skipping insertion in model container [2023-08-03 17:25:53,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:25:53" (1/1) ... [2023-08-03 17:25:53,780 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:25:53,912 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_mix033_tso.oepc_bound2.i[949,962] [2023-08-03 17:25:54,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:25:54,134 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:25:54,145 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_mix033_tso.oepc_bound2.i[949,962] [2023-08-03 17:25:54,165 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:25:54,167 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:25:54,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:25:54,235 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:25:54,236 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:25:54,241 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:25:54,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54 WrapperNode [2023-08-03 17:25:54,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:25:54,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:25:54,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:25:54,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:25:54,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,290 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2023-08-03 17:25:54,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:25:54,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:25:54,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:25:54,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:25:54,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:25:54,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:25:54,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:25:54,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:25:54,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (1/1) ... [2023-08-03 17:25:54,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:25:54,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:25:54,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 17:25:54,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 17:25:54,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:25:54,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:25:54,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:25:54,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:25:54,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:25:54,383 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:25:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:25:54,384 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:25:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:25:54,384 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 17:25:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 17:25:54,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:25:54,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:25:54,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:25:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:25:54,386 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 17:25:54,514 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:25:54,516 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:25:54,853 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:25:54,969 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:25:54,969 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 17:25:54,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:25:54 BoogieIcfgContainer [2023-08-03 17:25:54,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:25:54,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:25:54,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:25:54,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:25:54,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:25:53" (1/3) ... [2023-08-03 17:25:54,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc7cb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:25:54, skipping insertion in model container [2023-08-03 17:25:54,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:25:54" (2/3) ... [2023-08-03 17:25:54,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc7cb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:25:54, skipping insertion in model container [2023-08-03 17:25:54,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:25:54" (3/3) ... [2023-08-03 17:25:54,982 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix033_tso.oepc_bound2.i [2023-08-03 17:25:54,989 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:25:54,997 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:25:54,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:25:54,997 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:25:55,061 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:25:55,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 137 transitions, 289 flow [2023-08-03 17:25:55,259 INFO L124 PetriNetUnfolderBase]: 30/465 cut-off events. [2023-08-03 17:25:55,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:25:55,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 465 events. 30/465 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2096 event pairs, 0 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 278. Up to 16 conditions per place. [2023-08-03 17:25:55,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 137 transitions, 289 flow [2023-08-03 17:25:55,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 137 transitions, 289 flow [2023-08-03 17:25:55,273 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:25:55,281 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 137 transitions, 289 flow [2023-08-03 17:25:55,284 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 137 transitions, 289 flow [2023-08-03 17:25:55,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 137 transitions, 289 flow [2023-08-03 17:25:55,338 INFO L124 PetriNetUnfolderBase]: 30/465 cut-off events. [2023-08-03 17:25:55,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:25:55,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 465 events. 30/465 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2096 event pairs, 0 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 278. Up to 16 conditions per place. [2023-08-03 17:25:55,346 INFO L119 LiptonReduction]: Number of co-enabled transitions 3194 [2023-08-03 17:25:59,123 INFO L134 LiptonReduction]: Checked pairs total: 8737 [2023-08-03 17:25:59,123 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-03 17:25:59,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:25:59,141 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;@7f0c8967, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:25:59,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:25:59,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:25:59,144 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 17:25:59,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:25:59,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:25:59,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:25:59,145 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:25:59,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:25:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash 559372824, now seen corresponding path program 1 times [2023-08-03 17:25:59,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:25:59,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374000558] [2023-08-03 17:25:59,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:25:59,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:25:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:25:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:25:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:25:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374000558] [2023-08-03 17:25:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374000558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:25:59,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:25:59,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:25:59,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150158313] [2023-08-03 17:25:59,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:25:59,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:25:59,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:25:59,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:25:59,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:25:59,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 251 [2023-08-03 17:25:59,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:25:59,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:25:59,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 251 [2023-08-03 17:25:59,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:25:59,897 INFO L124 PetriNetUnfolderBase]: 2582/4313 cut-off events. [2023-08-03 17:25:59,897 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-03 17:25:59,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8324 conditions, 4313 events. 2582/4313 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 26264 event pairs, 1592 based on Foata normal form. 140/3717 useless extension candidates. Maximal degree in co-relation 8303. Up to 3903 conditions per place. [2023-08-03 17:25:59,926 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 31 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-03 17:25:59,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 161 flow [2023-08-03 17:25:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:25:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:25:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-03 17:25:59,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126162018592297 [2023-08-03 17:25:59,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-03 17:25:59,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-03 17:25:59,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:25:59,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-03 17:25:59,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:25:59,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:25:59,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:25:59,961 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 89 flow. Second operand 3 states and 386 transitions. [2023-08-03 17:25:59,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 161 flow [2023-08-03 17:25:59,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 161 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:25:59,967 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 95 flow [2023-08-03 17:25:59,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-03 17:25:59,973 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2023-08-03 17:25:59,974 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 95 flow [2023-08-03 17:25:59,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:25:59,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:25:59,974 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:25:59,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:25:59,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:25:59,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:25:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash 147920115, now seen corresponding path program 1 times [2023-08-03 17:25:59,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:25:59,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512336795] [2023-08-03 17:25:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:25:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:26:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:26:00,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:26:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:26:00,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:26:00,050 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:26:00,051 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 17:26:00,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:26:00,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:26:00,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:26:00,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:26:00,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:26:00,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:26:00,054 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:26:00,056 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:26:00,056 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:26:00,079 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:26:00,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 166 transitions, 368 flow [2023-08-03 17:26:00,236 INFO L124 PetriNetUnfolderBase]: 93/1433 cut-off events. [2023-08-03 17:26:00,236 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:26:00,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1433 events. 93/1433 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10026 event pairs, 0 based on Foata normal form. 0/1268 useless extension candidates. Maximal degree in co-relation 1038. Up to 54 conditions per place. [2023-08-03 17:26:00,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 166 transitions, 368 flow [2023-08-03 17:26:00,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 166 transitions, 368 flow [2023-08-03 17:26:00,249 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:26:00,249 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 166 transitions, 368 flow [2023-08-03 17:26:00,249 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 166 transitions, 368 flow [2023-08-03 17:26:00,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 166 transitions, 368 flow [2023-08-03 17:26:00,394 INFO L124 PetriNetUnfolderBase]: 93/1433 cut-off events. [2023-08-03 17:26:00,395 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:26:00,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1433 events. 93/1433 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10026 event pairs, 0 based on Foata normal form. 0/1268 useless extension candidates. Maximal degree in co-relation 1038. Up to 54 conditions per place. [2023-08-03 17:26:00,432 INFO L119 LiptonReduction]: Number of co-enabled transitions 7888 [2023-08-03 17:26:03,933 INFO L134 LiptonReduction]: Checked pairs total: 27830 [2023-08-03 17:26:03,933 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-03 17:26:03,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:26:03,936 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;@7f0c8967, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:26:03,936 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 17:26:03,943 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:26:03,946 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-03 17:26:03,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:26:03,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:26:03,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:26:03,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:26:03,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:26:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash 859078180, now seen corresponding path program 1 times [2023-08-03 17:26:03,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:26:03,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911527681] [2023-08-03 17:26:03,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:26:03,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:26:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:26:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:26:04,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:26:04,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911527681] [2023-08-03 17:26:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911527681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:26:04,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:26:04,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:26:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60719817] [2023-08-03 17:26:04,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:26:04,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:26:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:26:04,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:26:04,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:26:04,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 285 [2023-08-03 17:26:04,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:26:04,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:26:04,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 285 [2023-08-03 17:26:04,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:27:02,056 INFO L124 PetriNetUnfolderBase]: 468866/644706 cut-off events. [2023-08-03 17:27:02,057 INFO L125 PetriNetUnfolderBase]: For 9288/9288 co-relation queries the response was YES. [2023-08-03 17:27:04,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243764 conditions, 644706 events. 468866/644706 cut-off events. For 9288/9288 co-relation queries the response was YES. Maximal size of possible extension queue 20499. Compared 5364273 event pairs, 380024 based on Foata normal form. 13020/561317 useless extension candidates. Maximal degree in co-relation 267677. Up to 587323 conditions per place. [2023-08-03 17:27:06,627 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 44 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-03 17:27:06,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 66 transitions, 260 flow [2023-08-03 17:27:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:27:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:27:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2023-08-03 17:27:06,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5403508771929825 [2023-08-03 17:27:06,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2023-08-03 17:27:06,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2023-08-03 17:27:06,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:27:06,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2023-08-03 17:27:06,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:27:06,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:27:06,640 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:27:06,640 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 160 flow. Second operand 3 states and 462 transitions. [2023-08-03 17:27:06,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 66 transitions, 260 flow [2023-08-03 17:27:06,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 66 transitions, 254 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 17:27:06,664 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 164 flow [2023-08-03 17:27:06,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2023-08-03 17:27:06,665 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 3 predicate places. [2023-08-03 17:27:06,665 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 164 flow [2023-08-03 17:27:06,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:27:06,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:27:06,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:27:06,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:27:06,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:27:06,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:27:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash -268981689, now seen corresponding path program 1 times [2023-08-03 17:27:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:27:06,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547259547] [2023-08-03 17:27:06,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:27:06,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:27:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:27:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:27:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:27:06,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547259547] [2023-08-03 17:27:06,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547259547] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:27:06,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807480860] [2023-08-03 17:27:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:27:06,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:27:06,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:27:06,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:27:06,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 17:27:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:27:06,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:27:06,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:27:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:27:06,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:27:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:27:06,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807480860] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:27:06,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:27:06,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:27:06,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063090269] [2023-08-03 17:27:06,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:27:06,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:27:06,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:27:06,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:27:06,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:27:06,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 285 [2023-08-03 17:27:06,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:27:06,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:27:06,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 285 [2023-08-03 17:27:06,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:27:57,441 INFO L124 PetriNetUnfolderBase]: 389314/530770 cut-off events. [2023-08-03 17:27:57,442 INFO L125 PetriNetUnfolderBase]: For 6296/6296 co-relation queries the response was YES. [2023-08-03 17:27:59,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023223 conditions, 530770 events. 389314/530770 cut-off events. For 6296/6296 co-relation queries the response was YES. Maximal size of possible extension queue 17196. Compared 4243788 event pairs, 247180 based on Foata normal form. 4/453861 useless extension candidates. Maximal degree in co-relation 267643. Up to 484009 conditions per place. [2023-08-03 17:28:01,520 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 49 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2023-08-03 17:28:01,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 73 transitions, 292 flow [2023-08-03 17:28:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:28:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:28:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2023-08-03 17:28:01,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280701754385965 [2023-08-03 17:28:01,523 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2023-08-03 17:28:01,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2023-08-03 17:28:01,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:28:01,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2023-08-03 17:28:01,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:28:01,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:28:01,528 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:28:01,528 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 164 flow. Second operand 4 states and 602 transitions. [2023-08-03 17:28:01,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 73 transitions, 292 flow [2023-08-03 17:28:01,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 73 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:28:01,530 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 182 flow [2023-08-03 17:28:01,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2023-08-03 17:28:01,531 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2023-08-03 17:28:01,531 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 182 flow [2023-08-03 17:28:01,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:28:01,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:28:01,532 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:28:01,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 17:28:01,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:28:01,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:28:01,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:28:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1281736300, now seen corresponding path program 1 times [2023-08-03 17:28:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:28:01,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976974526] [2023-08-03 17:28:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:28:01,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:28:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:28:01,830 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 17:28:01,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:28:01,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976974526] [2023-08-03 17:28:01,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976974526] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:28:01,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049237169] [2023-08-03 17:28:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:28:01,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:28:01,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:28:01,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:28:01,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 17:28:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:28:01,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:28:01,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:28:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:28:01,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:28:01,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049237169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:28:01,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:28:01,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:28:01,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220447573] [2023-08-03 17:28:01,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:28:01,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:28:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:28:01,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:28:01,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:28:01,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 285 [2023-08-03 17:28:01,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:28:01,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:28:01,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 285 [2023-08-03 17:28:01,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:28:47,537 INFO L124 PetriNetUnfolderBase]: 389290/530722 cut-off events. [2023-08-03 17:28:47,537 INFO L125 PetriNetUnfolderBase]: For 6396/6396 co-relation queries the response was YES. [2023-08-03 17:28:50,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023187 conditions, 530722 events. 389290/530722 cut-off events. For 6396/6396 co-relation queries the response was YES. Maximal size of possible extension queue 17196. Compared 4243888 event pairs, 247168 based on Foata normal form. 16/453825 useless extension candidates. Maximal degree in co-relation 267619. Up to 484008 conditions per place. [2023-08-03 17:28:52,734 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 49 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-03 17:28:52,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 71 transitions, 298 flow [2023-08-03 17:28:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:28:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:28:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2023-08-03 17:28:52,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178947368421053 [2023-08-03 17:28:52,758 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2023-08-03 17:28:52,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2023-08-03 17:28:52,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:28:52,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2023-08-03 17:28:52,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:28:52,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:28:52,765 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:28:52,766 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 182 flow. Second operand 5 states and 738 transitions. [2023-08-03 17:28:52,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 71 transitions, 298 flow [2023-08-03 17:28:52,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 71 transitions, 291 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:28:52,785 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 171 flow [2023-08-03 17:28:52,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2023-08-03 17:28:52,787 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2023-08-03 17:28:52,787 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 171 flow [2023-08-03 17:28:52,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:28:52,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:28:52,788 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:28:52,825 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 17:28:52,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:28:52,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:28:52,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:28:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash 907561003, now seen corresponding path program 1 times [2023-08-03 17:28:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:28:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524814628] [2023-08-03 17:28:52,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:28:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:28:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:28:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:28:53,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:28:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524814628] [2023-08-03 17:28:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524814628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:28:53,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:28:53,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:28:53,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578207914] [2023-08-03 17:28:53,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:28:53,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:28:53,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:28:53,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:28:53,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:28:53,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 285 [2023-08-03 17:28:53,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:28:53,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:28:53,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 285 [2023-08-03 17:28:53,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:29:32,864 INFO L124 PetriNetUnfolderBase]: 335018/468695 cut-off events. [2023-08-03 17:29:32,864 INFO L125 PetriNetUnfolderBase]: For 5801/5801 co-relation queries the response was YES. [2023-08-03 17:29:34,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892795 conditions, 468695 events. 335018/468695 cut-off events. For 5801/5801 co-relation queries the response was YES. Maximal size of possible extension queue 15118. Compared 3950071 event pairs, 55274 based on Foata normal form. 0/406470 useless extension candidates. Maximal degree in co-relation 425717. Up to 383649 conditions per place. [2023-08-03 17:29:36,259 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 67 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2023-08-03 17:29:36,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 89 transitions, 380 flow [2023-08-03 17:29:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:29:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:29:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-08-03 17:29:36,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2023-08-03 17:29:36,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-08-03 17:29:36,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-08-03 17:29:36,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:29:36,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-08-03 17:29:36,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:29:36,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:29:36,264 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:29:36,264 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 171 flow. Second operand 3 states and 494 transitions. [2023-08-03 17:29:36,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 89 transitions, 380 flow [2023-08-03 17:29:36,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 89 transitions, 375 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:29:36,270 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 187 flow [2023-08-03 17:29:36,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2023-08-03 17:29:36,270 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2023-08-03 17:29:36,271 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 187 flow [2023-08-03 17:29:36,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:29:36,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:29:36,271 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:29:36,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:29:36,272 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:29:36,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:29:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash 300284454, now seen corresponding path program 1 times [2023-08-03 17:29:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:29:36,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327223930] [2023-08-03 17:29:36,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:29:36,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:29:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:29:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:29:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:29:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327223930] [2023-08-03 17:29:36,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327223930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:29:36,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:29:36,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:29:36,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914195843] [2023-08-03 17:29:36,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:29:36,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:29:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:29:36,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:29:36,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:29:36,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 285 [2023-08-03 17:29:36,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:29:36,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:29:36,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 285 [2023-08-03 17:29:36,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:30:18,334 INFO L124 PetriNetUnfolderBase]: 326858/451879 cut-off events. [2023-08-03 17:30:18,334 INFO L125 PetriNetUnfolderBase]: For 32441/32441 co-relation queries the response was YES. [2023-08-03 17:30:20,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920504 conditions, 451879 events. 326858/451879 cut-off events. For 32441/32441 co-relation queries the response was YES. Maximal size of possible extension queue 15733. Compared 3715676 event pairs, 274810 based on Foata normal form. 0/399482 useless extension candidates. Maximal degree in co-relation 440325. Up to 406153 conditions per place. [2023-08-03 17:30:21,833 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 53 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-08-03 17:30:21,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 74 transitions, 322 flow [2023-08-03 17:30:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:30:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:30:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-03 17:30:21,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5461988304093567 [2023-08-03 17:30:21,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-03 17:30:21,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-03 17:30:21,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:30:21,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-03 17:30:21,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:30:21,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:30:21,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:30:21,838 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 187 flow. Second operand 3 states and 467 transitions. [2023-08-03 17:30:21,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 74 transitions, 322 flow [2023-08-03 17:30:21,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 74 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:30:21,870 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 196 flow [2023-08-03 17:30:21,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2023-08-03 17:30:21,871 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2023-08-03 17:30:21,871 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 196 flow [2023-08-03 17:30:21,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:30:21,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:30:21,872 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:30:21,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:30:21,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:30:21,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:30:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash 563034873, now seen corresponding path program 1 times [2023-08-03 17:30:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:30:21,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767518199] [2023-08-03 17:30:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:30:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:30:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:30:21,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:30:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:30:21,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:30:21,923 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:30:21,923 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 17:30:21,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 17:30:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 17:30:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 17:30:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 17:30:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 17:30:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 17:30:21,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:30:21,924 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 17:30:21,928 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:30:21,929 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:30:22,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:30:22 BasicIcfg [2023-08-03 17:30:22,005 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:30:22,005 INFO L158 Benchmark]: Toolchain (without parser) took 268275.19ms. Allocated memory was 356.5MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 308.2MB in the beginning and 12.2GB in the end (delta: -11.9GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-08-03 17:30:22,005 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 356.5MB. Free memory was 310.2MB in the beginning and 310.0MB in the end (delta: 190.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:30:22,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.54ms. Allocated memory is still 356.5MB. Free memory was 307.8MB in the beginning and 284.1MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:30:22,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.84ms. Allocated memory is still 356.5MB. Free memory was 284.1MB in the beginning and 281.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 17:30:22,006 INFO L158 Benchmark]: Boogie Preprocessor took 27.48ms. Allocated memory is still 356.5MB. Free memory was 281.3MB in the beginning and 279.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:30:22,007 INFO L158 Benchmark]: RCFGBuilder took 652.09ms. Allocated memory was 356.5MB in the beginning and 509.6MB in the end (delta: 153.1MB). Free memory was 279.2MB in the beginning and 449.9MB in the end (delta: -170.7MB). Peak memory consumption was 19.8MB. Max. memory is 16.0GB. [2023-08-03 17:30:22,007 INFO L158 Benchmark]: TraceAbstraction took 267031.25ms. Allocated memory was 509.6MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 449.9MB in the beginning and 12.2GB in the end (delta: -11.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-08-03 17:30:22,016 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.13ms. Allocated memory is still 356.5MB. Free memory was 310.2MB in the beginning and 310.0MB in the end (delta: 190.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 511.54ms. Allocated memory is still 356.5MB. Free memory was 307.8MB in the beginning and 284.1MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.84ms. Allocated memory is still 356.5MB. Free memory was 284.1MB in the beginning and 281.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.48ms. Allocated memory is still 356.5MB. Free memory was 281.3MB in the beginning and 279.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 652.09ms. Allocated memory was 356.5MB in the beginning and 509.6MB in the end (delta: 153.1MB). Free memory was 279.2MB in the beginning and 449.9MB in the end (delta: -170.7MB). Peak memory consumption was 19.8MB. Max. memory is 16.0GB. * TraceAbstraction took 267031.25ms. Allocated memory was 509.6MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 449.9MB in the beginning and 12.2GB in the end (delta: -11.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 139 PlacesBefore, 43 PlacesAfterwards, 137 TransitionsBefore, 37 TransitionsAfterwards, 3194 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 114 TotalNumberOfCompositions, 8737 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3670, independent: 3451, independent conditional: 0, independent unconditional: 3451, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1675, independent: 1638, independent conditional: 0, independent unconditional: 1638, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3670, independent: 1813, independent conditional: 0, independent unconditional: 1813, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1675, unknown conditional: 0, unknown unconditional: 1675] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 174 PlacesBefore, 74 PlacesAfterwards, 166 TransitionsBefore, 62 TransitionsAfterwards, 7888 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, 27830 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11364, independent: 10961, independent conditional: 0, independent unconditional: 10961, dependent: 403, dependent conditional: 0, dependent unconditional: 403, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3905, independent: 3827, independent conditional: 0, independent unconditional: 3827, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11364, independent: 7134, independent conditional: 0, independent unconditional: 7134, dependent: 325, dependent conditional: 0, dependent unconditional: 325, unknown: 3905, unknown conditional: 0, unknown unconditional: 3905] , Statistics on independence cache: Total cache size (in pairs): 564, Positive cache size: 524, Positive conditional cache size: 0, Positive unconditional cache size: 524, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891[2]; [L841] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L841] COND TRUE 0 asdf<2 [L841] FCALL, FORK 0 pthread_create(&t891[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t891[asdf], ((void *)0), P0, ((void *)0))=-4, t891={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L841] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L841] COND TRUE 0 asdf<2 [L841] FCALL, FORK 0 pthread_create(&t891[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t891[asdf], ((void *)0), P0, ((void *)0))=-3, t891={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L841] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L841] COND FALSE 0 !(asdf<2) [L842] 0 pthread_t t892[2]; [L843] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L843] COND TRUE 0 asdf<2 [L843] FCALL, FORK 0 pthread_create(&t892[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t892[asdf], ((void *)0), P1, ((void *)0))=-2, t891={5:0}, t892={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 3 x$w_buff1 = x$w_buff0 [L772] 3 x$w_buff0 = 2 [L773] 3 x$w_buff1_used = x$w_buff0_used [L774] 3 x$w_buff0_used = (_Bool)1 [L775] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L775] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L843] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L843] COND TRUE 0 asdf<2 [L843] FCALL, FORK 0 pthread_create(&t892[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t892[asdf], ((void *)0), P1, ((void *)0))=-1, t891={5:0}, t892={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 4 x$w_buff1 = x$w_buff0 [L772] 4 x$w_buff0 = 2 [L773] 4 x$w_buff1_used = x$w_buff0_used [L774] 4 x$w_buff0_used = (_Bool)1 [L775] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=0, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 841]: 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: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 162 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: 5.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 64 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=95occurred 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 10 procedures, 191 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 261.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 256.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 9 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=5, InterpolantAutomatonStates: 18, 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.6s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 304 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 23/31 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 17:30:22,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...