/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_mix038_tso.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:31:32,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:31:33,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:31:33,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:31:33,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:31:33,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:31:33,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:31:33,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:31:33,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:31:33,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:31:33,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:31:33,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:31:33,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:31:33,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:31:33,093 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:31:33,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:31:33,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:31:33,094 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:31:33,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:31:33,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:31:33,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:31:33,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:31:33,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:31:33,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:31:33,095 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:31:33,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:31:33,096 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:31:33,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:31:33,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:31:33,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:31:33,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:31:33,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:31:33,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:31:33,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:31:33,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:31:33,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:31:33,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:31:33,099 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:31:33,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:31:33,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:31:33,100 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:31:33,100 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:31:33,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:31:33,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:31:33,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:31:33,361 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:31:33,361 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:31:33,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix038_tso.oepc_bound2.i [2023-08-03 17:31:34,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:31:34,720 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:31:34,720 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix038_tso.oepc_bound2.i [2023-08-03 17:31:34,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffeb2e129/43751baee3854fd99a4cde24fb977c77/FLAGbc2cf3812 [2023-08-03 17:31:34,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffeb2e129/43751baee3854fd99a4cde24fb977c77 [2023-08-03 17:31:34,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:31:34,749 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:31:34,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:31:34,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:31:34,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:31:34,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:31:34" (1/1) ... [2023-08-03 17:31:34,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c309807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:34, skipping insertion in model container [2023-08-03 17:31:34,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:31:34" (1/1) ... [2023-08-03 17:31:34,801 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:31:34,929 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_mix038_tso.oepc_bound2.i[949,962] [2023-08-03 17:31:35,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:31:35,124 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:31:35,135 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_mix038_tso.oepc_bound2.i[949,962] [2023-08-03 17:31:35,155 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:31:35,157 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:31:35,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:31:35,249 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:31:35,250 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:31:35,254 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:31:35,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35 WrapperNode [2023-08-03 17:31:35,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:31:35,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:31:35,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:31:35,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:31:35,261 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:31:35" (1/1) ... [2023-08-03 17:31:35,275 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:31:35" (1/1) ... [2023-08-03 17:31:35,299 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 171 [2023-08-03 17:31:35,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:31:35,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:31:35,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:31:35,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:31:35,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35" (1/1) ... [2023-08-03 17:31:35,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35" (1/1) ... [2023-08-03 17:31:35,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35" (1/1) ... [2023-08-03 17:31:35,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35" (1/1) ... [2023-08-03 17:31:35,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35" (1/1) ... [2023-08-03 17:31:35,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35" (1/1) ... [2023-08-03 17:31:35,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35" (1/1) ... [2023-08-03 17:31:35,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35" (1/1) ... [2023-08-03 17:31:35,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:31:35,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:31:35,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:31:35,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:31:35,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35" (1/1) ... [2023-08-03 17:31:35,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:31:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:31:35,366 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:31:35,373 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:31:35,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:31:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:31:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:31:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:31:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:31:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:31:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:31:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:31:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:31:35,398 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 17:31:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 17:31:35,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:31:35,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:31:35,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:31:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:31:35,399 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:31:35,511 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:31:35,513 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:31:35,781 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:31:35,898 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:31:35,898 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 17:31:35,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:31:35 BoogieIcfgContainer [2023-08-03 17:31:35,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:31:35,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:31:35,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:31:35,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:31:35,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:31:34" (1/3) ... [2023-08-03 17:31:35,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760b5dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:31:35, skipping insertion in model container [2023-08-03 17:31:35,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:31:35" (2/3) ... [2023-08-03 17:31:35,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760b5dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:31:35, skipping insertion in model container [2023-08-03 17:31:35,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:31:35" (3/3) ... [2023-08-03 17:31:35,909 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix038_tso.oepc_bound2.i [2023-08-03 17:31:35,916 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:31:35,925 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:31:35,925 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:31:35,925 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:31:35,981 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:31:36,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 133 transitions, 281 flow [2023-08-03 17:31:36,174 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-03 17:31:36,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:31:36,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2060 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-08-03 17:31:36,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 133 transitions, 281 flow [2023-08-03 17:31:36,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 133 transitions, 281 flow [2023-08-03 17:31:36,197 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:31:36,209 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 133 transitions, 281 flow [2023-08-03 17:31:36,213 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 133 transitions, 281 flow [2023-08-03 17:31:36,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 133 transitions, 281 flow [2023-08-03 17:31:36,281 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-03 17:31:36,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:31:36,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2060 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-08-03 17:31:36,291 INFO L119 LiptonReduction]: Number of co-enabled transitions 2914 [2023-08-03 17:31:40,721 INFO L134 LiptonReduction]: Checked pairs total: 7019 [2023-08-03 17:31:40,721 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-03 17:31:40,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:31:40,737 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;@340cfec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:31:40,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:31:40,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:31:40,741 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-03 17:31:40,741 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:31:40,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:31:40,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:31:40,742 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:31:40,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:31:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash 547845277, now seen corresponding path program 1 times [2023-08-03 17:31:40,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:31:40,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855452908] [2023-08-03 17:31:40,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:31:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:31:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:31:40,984 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:31:40,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:31:40,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855452908] [2023-08-03 17:31:40,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855452908] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:31:40,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:31:40,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:31:40,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570433798] [2023-08-03 17:31:40,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:31:40,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:31:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:31:41,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:31:41,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:31:41,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-03 17:31:41,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:31:41,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:31:41,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-03 17:31:41,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:31:41,445 INFO L124 PetriNetUnfolderBase]: 1677/2716 cut-off events. [2023-08-03 17:31:41,446 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-03 17:31:41,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5422 conditions, 2716 events. 1677/2716 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15384 event pairs, 1008 based on Foata normal form. 0/2216 useless extension candidates. Maximal degree in co-relation 5401. Up to 2570 conditions per place. [2023-08-03 17:31:41,463 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 28 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-03 17:31:41,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 149 flow [2023-08-03 17:31:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:31:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:31:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-03 17:31:41,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013550135501355 [2023-08-03 17:31:41,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-03 17:31:41,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-03 17:31:41,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:31:41,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-03 17:31:41,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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:31:41,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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:31:41,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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:31:41,490 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 81 flow. Second operand 3 states and 370 transitions. [2023-08-03 17:31:41,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 149 flow [2023-08-03 17:31:41,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 149 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:31:41,494 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 89 flow [2023-08-03 17:31:41,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-03 17:31:41,500 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-03 17:31:41,501 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 89 flow [2023-08-03 17:31:41,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:31:41,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:31:41,502 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:31:41,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:31:41,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:31:41,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:31:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash -192131539, now seen corresponding path program 1 times [2023-08-03 17:31:41,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:31:41,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884742283] [2023-08-03 17:31:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:31:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:31:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:31:41,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:31:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:31:41,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:31:41,589 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:31:41,590 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 17:31:41,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:31:41,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:31:41,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:31:41,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:31:41,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:31:41,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:31:41,596 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:31:41,599 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:31:41,599 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:31:41,639 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:31:41,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 356 flow [2023-08-03 17:31:41,808 INFO L124 PetriNetUnfolderBase]: 93/1419 cut-off events. [2023-08-03 17:31:41,808 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:31:41,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1419 events. 93/1419 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9914 event pairs, 0 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 1024. Up to 54 conditions per place. [2023-08-03 17:31:41,816 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 160 transitions, 356 flow [2023-08-03 17:31:41,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 160 transitions, 356 flow [2023-08-03 17:31:41,821 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:31:41,821 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 160 transitions, 356 flow [2023-08-03 17:31:41,821 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 160 transitions, 356 flow [2023-08-03 17:31:41,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 356 flow [2023-08-03 17:31:41,960 INFO L124 PetriNetUnfolderBase]: 93/1419 cut-off events. [2023-08-03 17:31:41,960 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:31:41,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1419 events. 93/1419 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9914 event pairs, 0 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 1024. Up to 54 conditions per place. [2023-08-03 17:31:41,998 INFO L119 LiptonReduction]: Number of co-enabled transitions 7116 [2023-08-03 17:31:46,048 INFO L134 LiptonReduction]: Checked pairs total: 25130 [2023-08-03 17:31:46,048 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-03 17:31:46,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:31:46,051 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;@340cfec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:31:46,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 17:31:46,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:31:46,054 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-08-03 17:31:46,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:31:46,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:31:46,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:31:46,054 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:31:46,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:31:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash 842658843, now seen corresponding path program 1 times [2023-08-03 17:31:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:31:46,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907485177] [2023-08-03 17:31:46,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:31:46,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:31:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:31:46,095 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:31:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:31:46,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907485177] [2023-08-03 17:31:46,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907485177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:31:46,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:31:46,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:31:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036672757] [2023-08-03 17:31:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:31:46,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:31:46,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:31:46,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:31:46,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:31:46,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281 [2023-08-03 17:31:46,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:31:46,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:31:46,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281 [2023-08-03 17:31:46,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:32:32,954 INFO L124 PetriNetUnfolderBase]: 363272/498400 cut-off events. [2023-08-03 17:32:32,954 INFO L125 PetriNetUnfolderBase]: For 9556/9556 co-relation queries the response was YES. [2023-08-03 17:32:34,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966424 conditions, 498400 events. 363272/498400 cut-off events. For 9556/9556 co-relation queries the response was YES. Maximal size of possible extension queue 14948. Compared 3990643 event pairs, 293960 based on Foata normal form. 0/429583 useless extension candidates. Maximal degree in co-relation 208041. Up to 455689 conditions per place. [2023-08-03 17:32:36,703 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 42 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-03 17:32:36,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 244 flow [2023-08-03 17:32:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:32:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:32:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-03 17:32:36,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231316725978647 [2023-08-03 17:32:36,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-03 17:32:36,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-03 17:32:36,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:32:36,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-03 17:32:36,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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:32:36,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:32:36,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:32:36,717 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 146 flow. Second operand 3 states and 441 transitions. [2023-08-03 17:32:36,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 244 flow [2023-08-03 17:32:36,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 238 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 17:32:36,737 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 152 flow [2023-08-03 17:32:36,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-08-03 17:32:36,738 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 17:32:36,738 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 152 flow [2023-08-03 17:32:36,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:32:36,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:32:36,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:32:36,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:32:36,739 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:32:36,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:32:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1316635047, now seen corresponding path program 1 times [2023-08-03 17:32:36,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:32:36,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981640142] [2023-08-03 17:32:36,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:32:36,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:32:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:32:36,802 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:32:36,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:32:36,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981640142] [2023-08-03 17:32:36,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981640142] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:32:36,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989776678] [2023-08-03 17:32:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:32:36,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:32:36,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:32:36,807 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:32:36,836 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:32:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:32:36,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:32:36,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:32:36,985 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:32:36,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:32:37,001 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:32:37,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989776678] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:32:37,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:32:37,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:32:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835053709] [2023-08-03 17:32:37,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:32:37,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:32:37,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:32:37,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:32:37,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:32:37,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 281 [2023-08-03 17:32:37,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:32:37,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:32:37,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 281 [2023-08-03 17:32:37,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:33:13,750 INFO L124 PetriNetUnfolderBase]: 301714/410194 cut-off events. [2023-08-03 17:33:13,751 INFO L125 PetriNetUnfolderBase]: For 6296/6296 co-relation queries the response was YES. [2023-08-03 17:33:15,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794455 conditions, 410194 events. 301714/410194 cut-off events. For 6296/6296 co-relation queries the response was YES. Maximal size of possible extension queue 12687. Compared 3162544 event pairs, 190828 based on Foata normal form. 4/355253 useless extension candidates. Maximal degree in co-relation 207847. Up to 375577 conditions per place. [2023-08-03 17:33:17,035 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 47 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-03 17:33:17,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 276 flow [2023-08-03 17:33:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:33:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:33:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-08-03 17:33:17,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124555160142349 [2023-08-03 17:33:17,039 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-08-03 17:33:17,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-08-03 17:33:17,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:33:17,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-08-03 17:33:17,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:33:17,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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:33:17,044 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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:33:17,045 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 152 flow. Second operand 4 states and 576 transitions. [2023-08-03 17:33:17,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 276 flow [2023-08-03 17:33:17,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 67 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:33:17,047 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 170 flow [2023-08-03 17:33:17,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-08-03 17:33:17,048 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2023-08-03 17:33:17,048 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 170 flow [2023-08-03 17:33:17,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:33:17,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:33:17,049 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:33:17,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 17:33:17,254 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:33:17,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:33:17,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:33:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1538468728, now seen corresponding path program 1 times [2023-08-03 17:33:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:33:17,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077083155] [2023-08-03 17:33:17,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:33:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:33:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:33:17,354 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:33:17,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:33:17,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077083155] [2023-08-03 17:33:17,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077083155] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:33:17,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33795045] [2023-08-03 17:33:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:33:17,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:33:17,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:33:17,357 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:33:17,359 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:33:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:33:17,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:33:17,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:33:17,475 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:33:17,475 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:33:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33795045] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:33:17,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:33:17,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:33:17,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871488488] [2023-08-03 17:33:17,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:33:17,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:33:17,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:33:17,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:33:17,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:33:17,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 281 [2023-08-03 17:33:17,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 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:33:17,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:33:17,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 281 [2023-08-03 17:33:17,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:33:55,943 INFO L124 PetriNetUnfolderBase]: 301690/410146 cut-off events. [2023-08-03 17:33:55,944 INFO L125 PetriNetUnfolderBase]: For 6396/6396 co-relation queries the response was YES. [2023-08-03 17:33:57,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794419 conditions, 410146 events. 301690/410146 cut-off events. For 6396/6396 co-relation queries the response was YES. Maximal size of possible extension queue 12687. Compared 3161736 event pairs, 190816 based on Foata normal form. 16/355217 useless extension candidates. Maximal degree in co-relation 207823. Up to 375576 conditions per place. [2023-08-03 17:33:58,934 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 47 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-08-03 17:33:58,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 65 transitions, 282 flow [2023-08-03 17:33:58,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:33:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:33:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2023-08-03 17:33:58,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502491103202847 [2023-08-03 17:33:58,936 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 706 transitions. [2023-08-03 17:33:58,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 706 transitions. [2023-08-03 17:33:58,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:33:58,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 706 transitions. [2023-08-03 17:33:58,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 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:33:58,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 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:33:58,942 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 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:33:58,942 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 170 flow. Second operand 5 states and 706 transitions. [2023-08-03 17:33:58,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 65 transitions, 282 flow [2023-08-03 17:33:58,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 65 transitions, 275 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:33:58,946 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 159 flow [2023-08-03 17:33:58,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-08-03 17:33:58,947 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2023-08-03 17:33:58,947 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 159 flow [2023-08-03 17:33:58,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 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:33:58,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:33:58,948 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:33:58,957 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:33:59,152 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:33:59,153 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:33:59,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:33:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash -999873420, now seen corresponding path program 1 times [2023-08-03 17:33:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:33:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115932340] [2023-08-03 17:33:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:33:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:33:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:33:59,300 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:33:59,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:33:59,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115932340] [2023-08-03 17:33:59,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115932340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:33:59,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:33:59,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:33:59,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398521854] [2023-08-03 17:33:59,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:33:59,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:33:59,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:33:59,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:33:59,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:33:59,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 281 [2023-08-03 17:33:59,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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:33:59,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:33:59,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 281 [2023-08-03 17:33:59,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:34:28,567 INFO L124 PetriNetUnfolderBase]: 259610/342743 cut-off events. [2023-08-03 17:34:28,568 INFO L125 PetriNetUnfolderBase]: For 5801/5801 co-relation queries the response was YES. [2023-08-03 17:34:29,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673291 conditions, 342743 events. 259610/342743 cut-off events. For 5801/5801 co-relation queries the response was YES. Maximal size of possible extension queue 11157. Compared 2480962 event pairs, 42938 based on Foata normal form. 0/305574 useless extension candidates. Maximal degree in co-relation 320501. Up to 297729 conditions per place. [2023-08-03 17:34:30,907 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 63 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-08-03 17:34:30,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 356 flow [2023-08-03 17:34:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:34:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:34:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-03 17:34:30,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5599051008303677 [2023-08-03 17:34:30,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-03 17:34:30,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-03 17:34:30,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:34:30,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-03 17:34:30,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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:34:30,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:34:30,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:34:30,912 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 159 flow. Second operand 3 states and 472 transitions. [2023-08-03 17:34:30,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 356 flow [2023-08-03 17:34:30,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 81 transitions, 351 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:34:30,917 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 175 flow [2023-08-03 17:34:30,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-08-03 17:34:30,918 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2023-08-03 17:34:30,918 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 175 flow [2023-08-03 17:34:30,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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:34:30,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:34:30,919 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:34:30,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:34:30,919 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:34:30,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:34:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -931499438, now seen corresponding path program 1 times [2023-08-03 17:34:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:34:30,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210893128] [2023-08-03 17:34:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:34:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:34:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:34:31,195 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:34:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:34:31,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210893128] [2023-08-03 17:34:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210893128] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:34:31,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:34:31,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:34:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194596948] [2023-08-03 17:34:31,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:34:31,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:34:31,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:34:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:34:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:34:31,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281 [2023-08-03 17:34:31,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:34:31,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:34:31,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281 [2023-08-03 17:34:31,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:35:05,303 INFO L124 PetriNetUnfolderBase]: 253322/352151 cut-off events. [2023-08-03 17:35:05,304 INFO L125 PetriNetUnfolderBase]: For 26409/26409 co-relation queries the response was YES. [2023-08-03 17:35:07,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717912 conditions, 352151 events. 253322/352151 cut-off events. For 26409/26409 co-relation queries the response was YES. Maximal size of possible extension queue 11331. Compared 2817447 event pairs, 212698 based on Foata normal form. 0/315222 useless extension candidates. Maximal degree in co-relation 343397. Up to 315145 conditions per place. [2023-08-03 17:35:08,717 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 51 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-03 17:35:08,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 306 flow [2023-08-03 17:35:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:35:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:35:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-08-03 17:35:08,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5302491103202847 [2023-08-03 17:35:08,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-08-03 17:35:08,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-08-03 17:35:08,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:35:08,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-08-03 17:35:08,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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:35:08,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:35:08,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:35:08,745 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 175 flow. Second operand 3 states and 447 transitions. [2023-08-03 17:35:08,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 306 flow [2023-08-03 17:35:08,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:35:08,749 INFO L231 Difference]: Finished difference. Result has 77 places, 58 transitions, 184 flow [2023-08-03 17:35:08,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=77, PETRI_TRANSITIONS=58} [2023-08-03 17:35:08,751 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 9 predicate places. [2023-08-03 17:35:08,751 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 58 transitions, 184 flow [2023-08-03 17:35:08,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:35:08,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:35:08,751 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:35:08,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:35:08,752 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:35:08,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:35:08,763 INFO L85 PathProgramCache]: Analyzing trace with hash 996483342, now seen corresponding path program 1 times [2023-08-03 17:35:08,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:35:08,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869479122] [2023-08-03 17:35:08,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:35:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:35:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:35:08,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:35:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:35:08,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:35:08,820 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:35:08,820 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 17:35:08,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 17:35:08,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 17:35:08,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 17:35:08,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 17:35:08,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 17:35:08,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 17:35:08,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:35:08,821 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 17:35:08,826 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:35:08,827 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:35:08,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:35:08 BasicIcfg [2023-08-03 17:35:08,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:35:08,930 INFO L158 Benchmark]: Toolchain (without parser) took 214181.20ms. Allocated memory was 499.1MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 448.0MB in the beginning and 12.5GB in the end (delta: -12.1GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2023-08-03 17:35:08,931 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 341.8MB. Free memory is still 294.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:35:08,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.42ms. Allocated memory is still 499.1MB. Free memory was 447.7MB in the beginning and 423.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:35:08,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.68ms. Allocated memory is still 499.1MB. Free memory was 423.9MB in the beginning and 421.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 17:35:08,933 INFO L158 Benchmark]: Boogie Preprocessor took 31.12ms. Allocated memory is still 499.1MB. Free memory was 421.1MB in the beginning and 419.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:35:08,935 INFO L158 Benchmark]: RCFGBuilder took 568.18ms. Allocated memory is still 499.1MB. Free memory was 419.0MB in the beginning and 439.7MB in the end (delta: -20.7MB). Peak memory consumption was 18.5MB. Max. memory is 16.0GB. [2023-08-03 17:35:08,936 INFO L158 Benchmark]: TraceAbstraction took 213027.22ms. Allocated memory was 499.1MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 438.6MB in the beginning and 12.5GB in the end (delta: -12.1GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2023-08-03 17:35:08,937 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 341.8MB. Free memory is still 294.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 505.42ms. Allocated memory is still 499.1MB. Free memory was 447.7MB in the beginning and 423.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.68ms. Allocated memory is still 499.1MB. Free memory was 423.9MB in the beginning and 421.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.12ms. Allocated memory is still 499.1MB. Free memory was 421.1MB in the beginning and 419.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 568.18ms. Allocated memory is still 499.1MB. Free memory was 419.0MB in the beginning and 439.7MB in the end (delta: -20.7MB). Peak memory consumption was 18.5MB. Max. memory is 16.0GB. * TraceAbstraction took 213027.22ms. Allocated memory was 499.1MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 438.6MB in the beginning and 12.5GB in the end (delta: -12.1GB). Peak memory consumption was 3.4GB. 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: 4.5s, 135 PlacesBefore, 40 PlacesAfterwards, 133 TransitionsBefore, 33 TransitionsAfterwards, 2914 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 5 ChoiceCompositions, 113 TotalNumberOfCompositions, 7019 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3534, independent: 3366, independent conditional: 0, independent unconditional: 3366, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1559, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3534, independent: 1845, independent conditional: 0, independent unconditional: 1845, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 1559, unknown conditional: 0, unknown unconditional: 1559] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 168 PlacesBefore, 68 PlacesAfterwards, 160 TransitionsBefore, 55 TransitionsAfterwards, 7116 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 5 ChoiceCompositions, 121 TotalNumberOfCompositions, 25130 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10104, independent: 9711, independent conditional: 0, independent unconditional: 9711, dependent: 393, dependent conditional: 0, dependent unconditional: 393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3580, independent: 3503, independent conditional: 0, independent unconditional: 3503, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10104, independent: 6208, independent conditional: 0, independent unconditional: 6208, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 3580, unknown conditional: 0, unknown unconditional: 3580] , Statistics on independence cache: Total cache size (in pairs): 429, Positive cache size: 398, Positive conditional cache size: 0, Positive unconditional cache size: 398, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019[2]; [L831] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1019={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] [L831] COND TRUE 0 asdf<2 [L831] FCALL, FORK 0 pthread_create(&t1019[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019[asdf], ((void *)0), P0, ((void *)0))=-4, t1019={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] [L831] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1019={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] [L831] COND TRUE 0 asdf<2 [L831] FCALL, FORK 0 pthread_create(&t1019[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019[asdf], ((void *)0), P0, ((void *)0))=-3, t1019={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] [L831] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1019={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] [L831] COND FALSE 0 !(asdf<2) [L832] 0 pthread_t t1020[2]; [L833] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={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] [L833] COND TRUE 0 asdf<2 [L833] FCALL, FORK 0 pthread_create(&t1020[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020[asdf], ((void *)0), P1, ((void *)0))=-2, t1019={5:0}, t1020={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] [L767] 3 x$w_buff1 = x$w_buff0 [L768] 3 x$w_buff0 = 2 [L769] 3 x$w_buff1_used = x$w_buff0_used [L770] 3 x$w_buff0_used = (_Bool)1 [L771] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L771] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L833] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={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] [L833] COND TRUE 0 asdf<2 [L833] FCALL, FORK 0 pthread_create(&t1020[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020[asdf], ((void *)0), P1, ((void *)0))=-1, t1019={5:0}, t1020={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] [L767] 4 x$w_buff1 = x$w_buff0 [L768] 4 x$w_buff0 = 2 [L769] 4 x$w_buff1_used = x$w_buff0_used [L770] 4 x$w_buff0_used = (_Bool)1 [L771] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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: 831]: 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: 833]: 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: 835]: 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, 156 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.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, 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, 58 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 58 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=89occurred 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.2s 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, 183 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: 207.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 201.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455 IncrementalHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 9 mSDtfsCounter, 455 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=184occurred 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, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 296 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:35:08,981 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...