/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_mix000.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 16:53:14,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 16:53:14,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 16:53:14,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 16:53:14,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 16:53:14,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 16:53:14,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 16:53:14,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 16:53:14,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 16:53:14,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 16:53:14,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 16:53:14,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 16:53:14,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 16:53:14,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 16:53:14,871 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 16:53:14,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 16:53:14,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 16:53:14,871 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 16:53:14,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 16:53:14,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 16:53:14,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 16:53:14,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 16:53:14,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 16:53:14,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 16:53:14,873 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 16:53:14,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 16:53:14,873 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 16:53:14,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 16:53:14,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 16:53:14,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 16:53:14,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 16:53:14,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 16:53:14,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 16:53:14,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 16:53:14,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 16:53:14,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 16:53:14,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 16:53:14,875 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 16:53:14,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 16:53:14,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 16:53:14,875 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 16:53:14,875 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 16:53:15,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 16:53:15,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 16:53:15,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 16:53:15,064 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 16:53:15,064 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 16:53:15,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix000.opt_bound2.i [2023-08-03 16:53:15,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 16:53:16,241 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 16:53:16,241 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix000.opt_bound2.i [2023-08-03 16:53:16,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6154971f/2796e0d0de2a47cb914b4d0bf1a0ad7d/FLAG797a86d7c [2023-08-03 16:53:16,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6154971f/2796e0d0de2a47cb914b4d0bf1a0ad7d [2023-08-03 16:53:16,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 16:53:16,271 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 16:53:16,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 16:53:16,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 16:53:16,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 16:53:16,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e7e26e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16, skipping insertion in model container [2023-08-03 16:53:16,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,321 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 16:53:16,449 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_mix000.opt_bound2.i[987,1000] [2023-08-03 16:53:16,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 16:53:16,623 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 16:53:16,633 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_mix000.opt_bound2.i[987,1000] [2023-08-03 16:53:16,649 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 16:53:16,650 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 16:53:16,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 16:53:16,703 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 16:53:16,703 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 16:53:16,712 INFO L206 MainTranslator]: Completed translation [2023-08-03 16:53:16,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16 WrapperNode [2023-08-03 16:53:16,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 16:53:16,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 16:53:16,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 16:53:16,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 16:53:16,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,744 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-08-03 16:53:16,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 16:53:16,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 16:53:16,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 16:53:16,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 16:53:16,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 16:53:16,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 16:53:16,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 16:53:16,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 16:53:16,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (1/1) ... [2023-08-03 16:53:16,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 16:53:16,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 16:53:16,805 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 16:53:16,812 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 16:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 16:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 16:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 16:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 16:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 16:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 16:53:16,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 16:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 16:53:16,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 16:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 16:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 16:53:16,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 16:53:16,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 16:53:16,841 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 16:53:16,919 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 16:53:16,920 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 16:53:17,114 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 16:53:17,222 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 16:53:17,222 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 16:53:17,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 04:53:17 BoogieIcfgContainer [2023-08-03 16:53:17,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 16:53:17,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 16:53:17,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 16:53:17,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 16:53:17,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 04:53:16" (1/3) ... [2023-08-03 16:53:17,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71633adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 04:53:17, skipping insertion in model container [2023-08-03 16:53:17,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 04:53:16" (2/3) ... [2023-08-03 16:53:17,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71633adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 04:53:17, skipping insertion in model container [2023-08-03 16:53:17,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 04:53:17" (3/3) ... [2023-08-03 16:53:17,231 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix000.opt_bound2.i [2023-08-03 16:53:17,235 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 16:53:17,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 16:53:17,241 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 16:53:17,241 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 16:53:17,278 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 16:53:17,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 16:53:17,376 INFO L124 PetriNetUnfolderBase]: 14/222 cut-off events. [2023-08-03 16:53:17,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 16:53:17,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 222 events. 14/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 624 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-03 16:53:17,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 16:53:17,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 105 transitions, 220 flow [2023-08-03 16:53:17,386 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 16:53:17,395 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 105 transitions, 220 flow [2023-08-03 16:53:17,398 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 105 transitions, 220 flow [2023-08-03 16:53:17,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 16:53:17,429 INFO L124 PetriNetUnfolderBase]: 14/222 cut-off events. [2023-08-03 16:53:17,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 16:53:17,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 222 events. 14/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 624 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-03 16:53:17,431 INFO L119 LiptonReduction]: Number of co-enabled transitions 1520 [2023-08-03 16:53:19,591 INFO L134 LiptonReduction]: Checked pairs total: 4151 [2023-08-03 16:53:19,591 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-08-03 16:53:19,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 16:53:19,603 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;@70a7ba76, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 16:53:19,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 16:53:19,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 16:53:19,606 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-03 16:53:19,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 16:53:19,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 16:53:19,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 16:53:19,607 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 16:53:19,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 16:53:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 472637540, now seen corresponding path program 1 times [2023-08-03 16:53:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 16:53:19,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226945516] [2023-08-03 16:53:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 16:53:19,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 16:53:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 16:53:19,777 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 16:53:19,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 16:53:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226945516] [2023-08-03 16:53:19,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226945516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 16:53:19,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 16:53:19,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 16:53:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60075236] [2023-08-03 16:53:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 16:53:19,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 16:53:19,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 16:53:19,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 16:53:19,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 16:53:19,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 196 [2023-08-03 16:53:19,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 16:53:19,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 16:53:19,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 196 [2023-08-03 16:53:19,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 16:53:19,947 INFO L124 PetriNetUnfolderBase]: 352/651 cut-off events. [2023-08-03 16:53:19,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 16:53:19,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 651 events. 352/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3049 event pairs, 160 based on Foata normal form. 28/547 useless extension candidates. Maximal degree in co-relation 1267. Up to 609 conditions per place. [2023-08-03 16:53:19,951 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-03 16:53:19,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 122 flow [2023-08-03 16:53:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 16:53:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 16:53:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-08-03 16:53:19,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965986394557823 [2023-08-03 16:53:19,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-08-03 16:53:19,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-08-03 16:53:19,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 16:53:19,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-08-03 16:53:19,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 16:53:19,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 16:53:19,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 16:53:19,969 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 64 flow. Second operand 3 states and 292 transitions. [2023-08-03 16:53:19,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 122 flow [2023-08-03 16:53:19,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 16:53:19,972 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 70 flow [2023-08-03 16:53:19,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-03 16:53:19,975 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-03 16:53:19,975 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 70 flow [2023-08-03 16:53:19,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 16:53:19,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 16:53:19,976 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 16:53:19,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 16:53:19,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 16:53:19,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 16:53:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1758062163, now seen corresponding path program 1 times [2023-08-03 16:53:19,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 16:53:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378009815] [2023-08-03 16:53:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 16:53:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 16:53:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 16:53:19,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 16:53:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 16:53:20,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 16:53:20,010 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 16:53:20,011 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-03 16:53:20,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 16:53:20,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 16:53:20,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-03 16:53:20,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 16:53:20,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 16:53:20,013 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 16:53:20,015 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 16:53:20,015 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 16:53:20,029 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 16:53:20,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 123 transitions, 270 flow [2023-08-03 16:53:20,059 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-03 16:53:20,060 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 16:53:20,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 459 events. 30/459 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1950 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 331. Up to 18 conditions per place. [2023-08-03 16:53:20,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 123 transitions, 270 flow [2023-08-03 16:53:20,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 123 transitions, 270 flow [2023-08-03 16:53:20,062 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 16:53:20,062 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 123 transitions, 270 flow [2023-08-03 16:53:20,063 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 123 transitions, 270 flow [2023-08-03 16:53:20,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 123 transitions, 270 flow [2023-08-03 16:53:20,091 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-03 16:53:20,092 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 16:53:20,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 459 events. 30/459 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1950 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 331. Up to 18 conditions per place. [2023-08-03 16:53:20,097 INFO L119 LiptonReduction]: Number of co-enabled transitions 3612 [2023-08-03 16:53:22,447 INFO L134 LiptonReduction]: Checked pairs total: 12290 [2023-08-03 16:53:22,456 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-03 16:53:22,461 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 16:53:22,465 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;@70a7ba76, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 16:53:22,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 16:53:22,468 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 16:53:22,469 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-03 16:53:22,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 16:53:22,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 16:53:22,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 16:53:22,476 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 16:53:22,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 16:53:22,479 INFO L85 PathProgramCache]: Analyzing trace with hash 699790714, now seen corresponding path program 1 times [2023-08-03 16:53:22,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 16:53:22,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614195071] [2023-08-03 16:53:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 16:53:22,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 16:53:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 16:53:22,529 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 16:53:22,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 16:53:22,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614195071] [2023-08-03 16:53:22,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614195071] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 16:53:22,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 16:53:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 16:53:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263887911] [2023-08-03 16:53:22,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 16:53:22,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 16:53:22,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 16:53:22,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 16:53:22,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 16:53:22,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 220 [2023-08-03 16:53:22,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 16:53:22,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 16:53:22,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 220 [2023-08-03 16:53:22,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 16:53:24,923 INFO L124 PetriNetUnfolderBase]: 21488/30716 cut-off events. [2023-08-03 16:53:24,924 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2023-08-03 16:53:24,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60614 conditions, 30716 events. 21488/30716 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 195737 event pairs, 15656 based on Foata normal form. 860/26568 useless extension candidates. Maximal degree in co-relation 13359. Up to 29265 conditions per place. [2023-08-03 16:53:25,150 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 35 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-03 16:53:25,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 188 flow [2023-08-03 16:53:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 16:53:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 16:53:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-03 16:53:25,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2023-08-03 16:53:25,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-03 16:53:25,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-03 16:53:25,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 16:53:25,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-03 16:53:25,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 16:53:25,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 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 16:53:25,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 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 16:53:25,162 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 106 flow. Second operand 3 states and 336 transitions. [2023-08-03 16:53:25,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 188 flow [2023-08-03 16:53:25,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 184 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 16:53:25,164 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 112 flow [2023-08-03 16:53:25,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-03 16:53:25,164 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-08-03 16:53:25,165 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 112 flow [2023-08-03 16:53:25,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 16:53:25,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 16:53:25,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 16:53:25,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 16:53:25,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 16:53:25,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 16:53:25,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1575303842, now seen corresponding path program 1 times [2023-08-03 16:53:25,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 16:53:25,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627001122] [2023-08-03 16:53:25,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 16:53:25,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 16:53:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 16:53:25,223 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 16:53:25,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 16:53:25,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627001122] [2023-08-03 16:53:25,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627001122] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 16:53:25,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658432058] [2023-08-03 16:53:25,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 16:53:25,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 16:53:25,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 16:53:25,229 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 16:53:25,236 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 16:53:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 16:53:25,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 16:53:25,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 16:53:25,345 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 16:53:25,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 16:53:25,359 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 16:53:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658432058] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 16:53:25,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 16:53:25,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-03 16:53:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943945742] [2023-08-03 16:53:25,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 16:53:25,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 16:53:25,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 16:53:25,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 16:53:25,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 16:53:25,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220 [2023-08-03 16:53:25,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 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 16:53:25,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 16:53:25,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220 [2023-08-03 16:53:25,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 16:53:27,318 INFO L124 PetriNetUnfolderBase]: 18130/25538 cut-off events. [2023-08-03 16:53:27,319 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2023-08-03 16:53:27,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50373 conditions, 25538 events. 18130/25538 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 155658 event pairs, 8812 based on Foata normal form. 4/21574 useless extension candidates. Maximal degree in co-relation 13363. Up to 24281 conditions per place. [2023-08-03 16:53:27,404 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 40 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-03 16:53:27,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 222 flow [2023-08-03 16:53:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 16:53:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 16:53:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2023-08-03 16:53:27,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965909090909091 [2023-08-03 16:53:27,406 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2023-08-03 16:53:27,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2023-08-03 16:53:27,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 16:53:27,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2023-08-03 16:53:27,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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 16:53:27,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 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 16:53:27,410 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 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 16:53:27,410 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 112 flow. Second operand 4 states and 437 transitions. [2023-08-03 16:53:27,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 222 flow [2023-08-03 16:53:27,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 16:53:27,411 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 130 flow [2023-08-03 16:53:27,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-03 16:53:27,412 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-08-03 16:53:27,412 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 130 flow [2023-08-03 16:53:27,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 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 16:53:27,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 16:53:27,412 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 16:53:27,419 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 16:53:27,616 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 16:53:27,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 16:53:27,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 16:53:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1671052461, now seen corresponding path program 1 times [2023-08-03 16:53:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 16:53:27,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183807101] [2023-08-03 16:53:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 16:53:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 16:53:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 16:53:27,676 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 16:53:27,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 16:53:27,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183807101] [2023-08-03 16:53:27,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183807101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 16:53:27,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 16:53:27,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 16:53:27,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005515725] [2023-08-03 16:53:27,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 16:53:27,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 16:53:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 16:53:27,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 16:53:27,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 16:53:27,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220 [2023-08-03 16:53:27,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 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 16:53:27,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 16:53:27,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220 [2023-08-03 16:53:27,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 16:53:29,433 INFO L124 PetriNetUnfolderBase]: 18106/25490 cut-off events. [2023-08-03 16:53:29,434 INFO L125 PetriNetUnfolderBase]: For 380/380 co-relation queries the response was YES. [2023-08-03 16:53:29,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50337 conditions, 25490 events. 18106/25490 cut-off events. For 380/380 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 155282 event pairs, 8800 based on Foata normal form. 16/21538 useless extension candidates. Maximal degree in co-relation 13339. Up to 24280 conditions per place. [2023-08-03 16:53:29,515 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 40 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-03 16:53:29,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 228 flow [2023-08-03 16:53:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 16:53:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 16:53:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-03 16:53:29,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48545454545454547 [2023-08-03 16:53:29,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-03 16:53:29,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-03 16:53:29,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 16:53:29,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-03 16:53:29,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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 16:53:29,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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 16:53:29,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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 16:53:29,520 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 130 flow. Second operand 5 states and 534 transitions. [2023-08-03 16:53:29,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 228 flow [2023-08-03 16:53:29,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 221 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 16:53:29,522 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 119 flow [2023-08-03 16:53:29,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-08-03 16:53:29,523 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-08-03 16:53:29,523 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 119 flow [2023-08-03 16:53:29,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 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 16:53:29,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 16:53:29,524 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 16:53:29,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 16:53:29,524 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 16:53:29,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 16:53:29,524 INFO L85 PathProgramCache]: Analyzing trace with hash -435951861, now seen corresponding path program 1 times [2023-08-03 16:53:29,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 16:53:29,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037688999] [2023-08-03 16:53:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 16:53:29,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 16:53:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 16:53:29,649 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 16:53:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 16:53:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037688999] [2023-08-03 16:53:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037688999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 16:53:29,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 16:53:29,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 16:53:29,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635250411] [2023-08-03 16:53:29,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 16:53:29,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 16:53:29,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 16:53:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 16:53:29,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 16:53:29,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 220 [2023-08-03 16:53:29,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 16:53:29,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 16:53:29,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 220 [2023-08-03 16:53:29,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 16:53:31,490 INFO L124 PetriNetUnfolderBase]: 16282/22999 cut-off events. [2023-08-03 16:53:31,490 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2023-08-03 16:53:31,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45321 conditions, 22999 events. 16282/22999 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 139316 event pairs, 3258 based on Foata normal form. 0/19831 useless extension candidates. Maximal degree in co-relation 21205. Up to 20801 conditions per place. [2023-08-03 16:53:31,551 INFO L140 encePairwiseOnDemand]: 215/220 looper letters, 47 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-03 16:53:31,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 258 flow [2023-08-03 16:53:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 16:53:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 16:53:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-03 16:53:31,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5409090909090909 [2023-08-03 16:53:31,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-03 16:53:31,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-03 16:53:31,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 16:53:31,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-03 16:53:31,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 16:53:31,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 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 16:53:31,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 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 16:53:31,557 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 119 flow. Second operand 3 states and 357 transitions. [2023-08-03 16:53:31,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 258 flow [2023-08-03 16:53:31,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 253 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 16:53:31,559 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 135 flow [2023-08-03 16:53:31,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-03 16:53:31,562 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-08-03 16:53:31,562 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 135 flow [2023-08-03 16:53:31,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 16:53:31,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 16:53:31,562 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 16:53:31,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 16:53:31,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 16:53:31,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 16:53:31,563 INFO L85 PathProgramCache]: Analyzing trace with hash -629632594, now seen corresponding path program 1 times [2023-08-03 16:53:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 16:53:31,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004448731] [2023-08-03 16:53:31,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 16:53:31,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 16:53:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 16:53:31,599 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 16:53:31,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 16:53:31,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004448731] [2023-08-03 16:53:31,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004448731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 16:53:31,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 16:53:31,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 16:53:31,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196465324] [2023-08-03 16:53:31,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 16:53:31,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 16:53:31,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 16:53:31,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 16:53:31,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 16:53:31,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 220 [2023-08-03 16:53:31,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 16:53:31,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 16:53:31,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 220 [2023-08-03 16:53:31,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 16:53:33,195 INFO L124 PetriNetUnfolderBase]: 16138/22615 cut-off events. [2023-08-03 16:53:33,195 INFO L125 PetriNetUnfolderBase]: For 1561/1561 co-relation queries the response was YES. [2023-08-03 16:53:33,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47926 conditions, 22615 events. 16138/22615 cut-off events. For 1561/1561 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 136372 event pairs, 12146 based on Foata normal form. 0/19495 useless extension candidates. Maximal degree in co-relation 22533. Up to 21409 conditions per place. [2023-08-03 16:53:33,267 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 45 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-03 16:53:33,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 256 flow [2023-08-03 16:53:33,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 16:53:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 16:53:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-03 16:53:33,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196969696969697 [2023-08-03 16:53:33,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-03 16:53:33,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-03 16:53:33,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 16:53:33,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-03 16:53:33,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 16:53:33,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 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 16:53:33,270 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 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 16:53:33,271 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 135 flow. Second operand 3 states and 343 transitions. [2023-08-03 16:53:33,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 256 flow [2023-08-03 16:53:33,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 16:53:33,275 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 146 flow [2023-08-03 16:53:33,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-03 16:53:33,275 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-08-03 16:53:33,275 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 146 flow [2023-08-03 16:53:33,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 16:53:33,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 16:53:33,276 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 16:53:33,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 16:53:33,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 16:53:33,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 16:53:33,276 INFO L85 PathProgramCache]: Analyzing trace with hash -937821675, now seen corresponding path program 1 times [2023-08-03 16:53:33,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 16:53:33,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765996023] [2023-08-03 16:53:33,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 16:53:33,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 16:53:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 16:53:33,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 16:53:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 16:53:33,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 16:53:33,322 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 16:53:33,322 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-03 16:53:33,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 16:53:33,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 16:53:33,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 16:53:33,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 16:53:33,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 16:53:33,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 16:53:33,322 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 16:53:33,326 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 16:53:33,326 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 16:53:33,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 04:53:33 BasicIcfg [2023-08-03 16:53:33,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 16:53:33,373 INFO L158 Benchmark]: Toolchain (without parser) took 17102.07ms. Allocated memory was 547.4MB in the beginning and 3.3GB in the end (delta: 2.7GB). Free memory was 503.3MB in the beginning and 2.3GB in the end (delta: -1.8GB). Peak memory consumption was 922.0MB. Max. memory is 16.0GB. [2023-08-03 16:53:33,373 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 356.5MB. Free memory is still 306.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 16:53:33,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.50ms. Allocated memory is still 547.4MB. Free memory was 503.3MB in the beginning and 479.5MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 16:53:33,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.58ms. Allocated memory is still 547.4MB. Free memory was 479.5MB in the beginning and 476.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 16:53:33,373 INFO L158 Benchmark]: Boogie Preprocessor took 23.41ms. Allocated memory is still 547.4MB. Free memory was 476.6MB in the beginning and 474.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 16:53:33,373 INFO L158 Benchmark]: RCFGBuilder took 455.57ms. Allocated memory is still 547.4MB. Free memory was 474.6MB in the beginning and 496.4MB in the end (delta: -21.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB. [2023-08-03 16:53:33,374 INFO L158 Benchmark]: TraceAbstraction took 16146.55ms. Allocated memory was 547.4MB in the beginning and 3.3GB in the end (delta: 2.7GB). Free memory was 495.4MB in the beginning and 2.3GB in the end (delta: -1.8GB). Peak memory consumption was 913.5MB. Max. memory is 16.0GB. [2023-08-03 16:53:33,374 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 356.5MB. Free memory is still 306.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 440.50ms. Allocated memory is still 547.4MB. Free memory was 503.3MB in the beginning and 479.5MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.58ms. Allocated memory is still 547.4MB. Free memory was 479.5MB in the beginning and 476.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.41ms. Allocated memory is still 547.4MB. Free memory was 476.6MB in the beginning and 474.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 455.57ms. Allocated memory is still 547.4MB. Free memory was 474.6MB in the beginning and 496.4MB in the end (delta: -21.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB. * TraceAbstraction took 16146.55ms. Allocated memory was 547.4MB in the beginning and 3.3GB in the end (delta: 2.7GB). Free memory was 495.4MB in the beginning and 2.3GB in the end (delta: -1.8GB). Peak memory consumption was 913.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 106 PlacesBefore, 31 PlacesAfterwards, 105 TransitionsBefore, 27 TransitionsAfterwards, 1520 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, 4151 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2189, independent: 2048, independent conditional: 0, independent unconditional: 2048, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 811, independent: 785, independent conditional: 0, independent unconditional: 785, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2189, independent: 1263, independent conditional: 0, independent unconditional: 1263, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 811, unknown conditional: 0, unknown unconditional: 811] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 128 PlacesBefore, 49 PlacesAfterwards, 123 TransitionsBefore, 41 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 97 TotalNumberOfCompositions, 12290 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4397, independent: 4125, independent conditional: 0, independent unconditional: 4125, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1822, independent: 1776, independent conditional: 0, independent unconditional: 1776, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4397, independent: 2349, independent conditional: 0, independent unconditional: 2349, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 1822, unknown conditional: 0, unknown unconditional: 1822] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 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_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0[2]; [L827] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] COND TRUE 0 asdf<2 [L827] FCALL, FORK 0 pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0))=-1, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] COND TRUE 0 asdf<2 [L827] FCALL, FORK 0 pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0))=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] COND FALSE 0 !(asdf<2) [L828] 0 pthread_t t1[2]; [L829] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] COND TRUE 0 asdf<2 [L829] FCALL, FORK 0 pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0))=1, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 3 x$w_buff1 = x$w_buff0 [L775] 3 x$w_buff0 = 1 [L776] 3 x$w_buff1_used = x$w_buff0_used [L777] 3 x$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] COND TRUE 0 asdf<2 [L829] FCALL, FORK 0 pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0))=2, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 4 x$w_buff1 = x$w_buff0 [L775] 4 x$w_buff0 = 1 [L776] 4 x$w_buff1_used = x$w_buff0_used [L777] 4 x$w_buff0_used = (_Bool)1 [L778] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x=0, y=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 827]: 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: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 120 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 138 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: 13.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 8 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred 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.3s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 20/23 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 16:53:33,388 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...