/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 23:11:10,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 23:11:10,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 23:11:10,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 23:11:10,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 23:11:10,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 23:11:10,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 23:11:10,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 23:11:10,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 23:11:10,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 23:11:10,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 23:11:10,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 23:11:10,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 23:11:10,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 23:11:10,136 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 23:11:10,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 23:11:10,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 23:11:10,137 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 23:11:10,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 23:11:10,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 23:11:10,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 23:11:10,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 23:11:10,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 23:11:10,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 23:11:10,139 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 23:11:10,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 23:11:10,139 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 23:11:10,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 23:11:10,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 23:11:10,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 23:11:10,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:11:10,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 23:11:10,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 23:11:10,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 23:11:10,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 23:11:10,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 23:11:10,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 23:11:10,141 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 23:11:10,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 23:11:10,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 23:11:10,142 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 23:11:10,142 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 -> INSUFFICIENT_FIRST [2023-08-03 23:11:10,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 23:11:10,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 23:11:10,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 23:11:10,315 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 23:11:10,316 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 23:11:10,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.opt_bound2.i [2023-08-03 23:11:11,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 23:11:11,441 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 23:11:11,442 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.opt_bound2.i [2023-08-03 23:11:11,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e32eb9eb/1a4a9659df6d4ac2a9d77ae9cbc93e72/FLAG973056151 [2023-08-03 23:11:11,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e32eb9eb/1a4a9659df6d4ac2a9d77ae9cbc93e72 [2023-08-03 23:11:11,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 23:11:11,465 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 23:11:11,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 23:11:11,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 23:11:11,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 23:11:11,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485a4ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11, skipping insertion in model container [2023-08-03 23:11:11,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,501 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 23:11:11,617 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_mix009.opt_bound2.i[987,1000] [2023-08-03 23:11:11,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:11:11,802 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 23:11:11,812 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_mix009.opt_bound2.i[987,1000] [2023-08-03 23:11:11,817 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 23:11:11,818 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 23:11:11,837 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:11:11,854 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:11:11,854 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:11:11,859 INFO L206 MainTranslator]: Completed translation [2023-08-03 23:11:11,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11 WrapperNode [2023-08-03 23:11:11,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 23:11:11,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 23:11:11,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 23:11:11,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 23:11:11,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,893 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-08-03 23:11:11,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 23:11:11,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 23:11:11,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 23:11:11,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 23:11:11,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 23:11:11,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 23:11:11,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 23:11:11,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 23:11:11,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (1/1) ... [2023-08-03 23:11:11,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:11:11,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:11:11,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 23:11:11,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 23:11:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 23:11:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 23:11:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 23:11:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 23:11:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 23:11:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 23:11:11,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 23:11:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 23:11:11,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 23:11:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 23:11:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 23:11:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 23:11:11,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 23:11:11,988 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 23:11:12,072 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 23:11:12,074 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 23:11:12,369 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 23:11:12,487 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 23:11:12,487 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 23:11:12,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:11:12 BoogieIcfgContainer [2023-08-03 23:11:12,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 23:11:12,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 23:11:12,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 23:11:12,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 23:11:12,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 11:11:11" (1/3) ... [2023-08-03 23:11:12,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dc9028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:11:12, skipping insertion in model container [2023-08-03 23:11:12,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:11:11" (2/3) ... [2023-08-03 23:11:12,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dc9028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:11:12, skipping insertion in model container [2023-08-03 23:11:12,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:11:12" (3/3) ... [2023-08-03 23:11:12,495 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix009.opt_bound2.i [2023-08-03 23:11:12,499 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 23:11:12,505 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 23:11:12,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 23:11:12,505 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 23:11:12,535 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:11:12,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 107 transitions, 224 flow [2023-08-03 23:11:12,633 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-03 23:11:12,634 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:11:12,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 224 events. 14/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 629 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2023-08-03 23:11:12,637 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 107 transitions, 224 flow [2023-08-03 23:11:12,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 80 transitions, 170 flow [2023-08-03 23:11:12,642 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:11:12,651 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 80 transitions, 170 flow [2023-08-03 23:11:12,653 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 80 transitions, 170 flow [2023-08-03 23:11:12,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 80 transitions, 170 flow [2023-08-03 23:11:12,678 INFO L124 PetriNetUnfolderBase]: 2/116 cut-off events. [2023-08-03 23:11:12,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:11:12,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 168 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 79. Up to 4 conditions per place. [2023-08-03 23:11:12,679 INFO L119 LiptonReduction]: Number of co-enabled transitions 724 [2023-08-03 23:11:14,925 INFO L134 LiptonReduction]: Checked pairs total: 1402 [2023-08-03 23:11:14,926 INFO L136 LiptonReduction]: Total number of compositions: 67 [2023-08-03 23:11:14,943 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:11:14,947 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;@63d3bd5d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:11:14,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:11:14,959 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:11:14,960 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-03 23:11:14,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:11:14,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:14,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:11:14,961 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:11:14,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash 454928415, now seen corresponding path program 1 times [2023-08-03 23:11:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657635522] [2023-08-03 23:11:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:14,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:11:15,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:15,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657635522] [2023-08-03 23:11:15,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657635522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:11:15,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:11:15,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:11:15,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544792845] [2023-08-03 23:11:15,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:11:15,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:11:15,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:15,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:11:15,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:11:15,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 174 [2023-08-03 23:11:15,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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 23:11:15,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:15,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 174 [2023-08-03 23:11:15,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:15,284 INFO L124 PetriNetUnfolderBase]: 65/155 cut-off events. [2023-08-03 23:11:15,284 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:11:15,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 155 events. 65/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 549 event pairs, 20 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 296. Up to 126 conditions per place. [2023-08-03 23:11:15,286 INFO L140 encePairwiseOnDemand]: 171/174 looper letters, 17 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-08-03 23:11:15,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 92 flow [2023-08-03 23:11:15,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:11:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:11:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2023-08-03 23:11:15,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-08-03 23:11:15,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2023-08-03 23:11:15,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2023-08-03 23:11:15,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:15,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2023-08-03 23:11:15,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 23:11:15,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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 23:11:15,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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 23:11:15,303 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 290 transitions. [2023-08-03 23:11:15,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 92 flow [2023-08-03 23:11:15,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 23:11:15,306 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-03 23:11:15,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-03 23:11:15,309 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-03 23:11:15,309 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-03 23:11:15,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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 23:11:15,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:15,310 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 23:11:15,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 23:11:15,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:11:15,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1209622196, now seen corresponding path program 1 times [2023-08-03 23:11:15,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:15,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544319401] [2023-08-03 23:11:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:11:15,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:11:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:11:15,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:11:15,341 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:11:15,342 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:11:15,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:11:15,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 23:11:15,343 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 23:11:15,344 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-03 23:11:15,345 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 23:11:15,345 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 23:11:15,362 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:11:15,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 126 transitions, 276 flow [2023-08-03 23:11:15,393 INFO L124 PetriNetUnfolderBase]: 30/462 cut-off events. [2023-08-03 23:11:15,393 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:11:15,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 462 events. 30/462 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1974 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 334. Up to 18 conditions per place. [2023-08-03 23:11:15,394 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 126 transitions, 276 flow [2023-08-03 23:11:15,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 99 transitions, 222 flow [2023-08-03 23:11:15,395 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:11:15,395 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 222 flow [2023-08-03 23:11:15,395 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 222 flow [2023-08-03 23:11:15,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 222 flow [2023-08-03 23:11:15,410 INFO L124 PetriNetUnfolderBase]: 3/219 cut-off events. [2023-08-03 23:11:15,410 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:11:15,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 219 events. 3/219 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 558 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 172. Up to 9 conditions per place. [2023-08-03 23:11:15,412 INFO L119 LiptonReduction]: Number of co-enabled transitions 2092 [2023-08-03 23:11:17,696 INFO L134 LiptonReduction]: Checked pairs total: 8735 [2023-08-03 23:11:17,696 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-08-03 23:11:17,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:11:17,699 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;@63d3bd5d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:11:17,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:11:17,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:11:17,704 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2023-08-03 23:11:17,704 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 23:11:17,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:17,704 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-03 23:11:17,704 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:11:17,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:17,705 INFO L85 PathProgramCache]: Analyzing trace with hash -636935312, now seen corresponding path program 1 times [2023-08-03 23:11:17,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:17,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181613445] [2023-08-03 23:11:17,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:17,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:11:17,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:17,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181613445] [2023-08-03 23:11:17,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181613445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:11:17,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:11:17,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:11:17,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470260096] [2023-08-03 23:11:17,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:11:17,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:11:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:17,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:11:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:11:17,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 196 [2023-08-03 23:11:17,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 23:11:17,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:17,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 196 [2023-08-03 23:11:17,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:18,555 INFO L124 PetriNetUnfolderBase]: 4261/6474 cut-off events. [2023-08-03 23:11:18,556 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2023-08-03 23:11:18,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13085 conditions, 6474 events. 4261/6474 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 40537 event pairs, 2944 based on Foata normal form. 0/5822 useless extension candidates. Maximal degree in co-relation 2888. Up to 6018 conditions per place. [2023-08-03 23:11:18,615 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 28 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-03 23:11:18,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 164 flow [2023-08-03 23:11:18,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:11:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:11:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-08-03 23:11:18,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5731292517006803 [2023-08-03 23:11:18,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-08-03 23:11:18,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-08-03 23:11:18,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:18,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-08-03 23:11:18,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 23:11:18,633 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 23:11:18,633 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 23:11:18,633 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 94 flow. Second operand 3 states and 337 transitions. [2023-08-03 23:11:18,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 164 flow [2023-08-03 23:11:18,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 160 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 23:11:18,636 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 102 flow [2023-08-03 23:11:18,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-03 23:11:18,637 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-08-03 23:11:18,637 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 102 flow [2023-08-03 23:11:18,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 23:11:18,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:18,637 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 23:11:18,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 23:11:18,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:11:18,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1785490444, now seen corresponding path program 1 times [2023-08-03 23:11:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:18,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797078044] [2023-08-03 23:11:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:18,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:11:18,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:18,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797078044] [2023-08-03 23:11:18,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797078044] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:11:18,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391836355] [2023-08-03 23:11:18,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:18,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:11:18,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:11:18,715 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 23:11:18,774 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 23:11:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:18,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:11:18,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:11:18,898 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 23:11:18,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:11:18,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391836355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:11:18,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:11:18,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:11:18,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663321849] [2023-08-03 23:11:18,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:11:18,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:11:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:11:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 23:11:18,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 196 [2023-08-03 23:11:18,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 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 23:11:18,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:18,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 196 [2023-08-03 23:11:18,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:19,475 INFO L124 PetriNetUnfolderBase]: 4237/6366 cut-off events. [2023-08-03 23:11:19,475 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2023-08-03 23:11:19,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12896 conditions, 6366 events. 4237/6366 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 39412 event pairs, 2580 based on Foata normal form. 16/5814 useless extension candidates. Maximal degree in co-relation 3433. Up to 5935 conditions per place. [2023-08-03 23:11:19,502 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 33 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-03 23:11:19,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 196 flow [2023-08-03 23:11:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:11:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:11:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2023-08-03 23:11:19,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5540816326530612 [2023-08-03 23:11:19,504 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2023-08-03 23:11:19,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2023-08-03 23:11:19,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:19,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2023-08-03 23:11:19,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 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 23:11:19,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 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 23:11:19,509 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 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 23:11:19,509 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 102 flow. Second operand 5 states and 543 transitions. [2023-08-03 23:11:19,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 196 flow [2023-08-03 23:11:19,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 23:11:19,511 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 116 flow [2023-08-03 23:11:19,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-08-03 23:11:19,513 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-08-03 23:11:19,513 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 116 flow [2023-08-03 23:11:19,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 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 23:11:19,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:19,514 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:11:19,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 23:11:19,717 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 23:11:19,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:11:19,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:19,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1572964247, now seen corresponding path program 1 times [2023-08-03 23:11:19,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:19,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001550078] [2023-08-03 23:11:19,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:19,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:11:19,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001550078] [2023-08-03 23:11:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001550078] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:11:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325366673] [2023-08-03 23:11:19,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:19,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:11:19,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:11:19,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:11:19,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 23:11:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:19,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:11:19,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:11:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:11:19,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:11:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:11:19,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325366673] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:11:19,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:11:19,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:11:19,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569270623] [2023-08-03 23:11:19,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:11:19,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:11:19,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:19,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:11:19,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:11:19,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 196 [2023-08-03 23:11:19,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:19,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:19,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 196 [2023-08-03 23:11:19,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:20,363 INFO L124 PetriNetUnfolderBase]: 3602/5388 cut-off events. [2023-08-03 23:11:20,363 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2023-08-03 23:11:20,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10914 conditions, 5388 events. 3602/5388 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 32426 event pairs, 1530 based on Foata normal form. 4/4927 useless extension candidates. Maximal degree in co-relation 5063. Up to 4961 conditions per place. [2023-08-03 23:11:20,386 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 33 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-03 23:11:20,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 202 flow [2023-08-03 23:11:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:11:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:11:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2023-08-03 23:11:20,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2023-08-03 23:11:20,388 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 441 transitions. [2023-08-03 23:11:20,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 441 transitions. [2023-08-03 23:11:20,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:20,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 441 transitions. [2023-08-03 23:11:20,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:20,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 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 23:11:20,392 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 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 23:11:20,392 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 116 flow. Second operand 4 states and 441 transitions. [2023-08-03 23:11:20,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 202 flow [2023-08-03 23:11:20,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 197 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 23:11:20,394 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 109 flow [2023-08-03 23:11:20,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2023-08-03 23:11:20,395 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-08-03 23:11:20,395 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 109 flow [2023-08-03 23:11:20,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:20,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:20,396 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:11:20,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 23:11:20,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:11:20,600 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:11:20,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1975297117, now seen corresponding path program 1 times [2023-08-03 23:11:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522858987] [2023-08-03 23:11:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:11:20,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:20,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522858987] [2023-08-03 23:11:20,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522858987] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:11:20,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838254966] [2023-08-03 23:11:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:20,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:11:20,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:11:20,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:11:20,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 23:11:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:20,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:11:20,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:11:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:11:20,742 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:11:20,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838254966] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:11:20,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:11:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:11:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025478973] [2023-08-03 23:11:20,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:11:20,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:11:20,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:20,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:11:20,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:11:20,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 196 [2023-08-03 23:11:20,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 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 23:11:20,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:20,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 196 [2023-08-03 23:11:20,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:21,003 INFO L124 PetriNetUnfolderBase]: 1778/2854 cut-off events. [2023-08-03 23:11:21,003 INFO L125 PetriNetUnfolderBase]: For 261/261 co-relation queries the response was YES. [2023-08-03 23:11:21,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5904 conditions, 2854 events. 1778/2854 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 16375 event pairs, 42 based on Foata normal form. 576/3202 useless extension candidates. Maximal degree in co-relation 2697. Up to 2240 conditions per place. [2023-08-03 23:11:21,009 INFO L140 encePairwiseOnDemand]: 194/196 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2023-08-03 23:11:21,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 225 flow [2023-08-03 23:11:21,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:11:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:11:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-08-03 23:11:21,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5752551020408163 [2023-08-03 23:11:21,011 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-08-03 23:11:21,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-08-03 23:11:21,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:21,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-08-03 23:11:21,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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 23:11:21,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 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 23:11:21,014 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 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 23:11:21,014 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 109 flow. Second operand 4 states and 451 transitions. [2023-08-03 23:11:21,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 225 flow [2023-08-03 23:11:21,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 23:11:21,017 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2023-08-03 23:11:21,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2023-08-03 23:11:21,019 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-08-03 23:11:21,019 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2023-08-03 23:11:21,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 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 23:11:21,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:11:21,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:11:21,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-03 23:11:21,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:11:21,225 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-03 23:11:21,225 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-03 23:11:21,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 126 transitions, 276 flow [2023-08-03 23:11:21,256 INFO L124 PetriNetUnfolderBase]: 30/462 cut-off events. [2023-08-03 23:11:21,256 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:11:21,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 462 events. 30/462 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1974 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 334. Up to 18 conditions per place. [2023-08-03 23:11:21,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 126 transitions, 276 flow [2023-08-03 23:11:21,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 125 transitions, 270 flow [2023-08-03 23:11:21,260 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:11:21,262 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 125 transitions, 270 flow [2023-08-03 23:11:21,262 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 125 transitions, 270 flow [2023-08-03 23:11:21,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 125 transitions, 270 flow [2023-08-03 23:11:21,311 INFO L124 PetriNetUnfolderBase]: 30/461 cut-off events. [2023-08-03 23:11:21,311 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-03 23:11:21,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 461 events. 30/461 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1967 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 331. Up to 18 conditions per place. [2023-08-03 23:11:21,316 INFO L119 LiptonReduction]: Number of co-enabled transitions 3896 [2023-08-03 23:11:23,642 INFO L134 LiptonReduction]: Checked pairs total: 12785 [2023-08-03 23:11:23,642 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-03 23:11:23,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 23:11:23,649 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;@63d3bd5d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:11:23,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 23:11:23,652 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:11:23,653 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-03 23:11:23,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:11:23,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:23,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:11:23,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:11:23,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash 753153673, now seen corresponding path program 1 times [2023-08-03 23:11:23,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:23,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521993482] [2023-08-03 23:11:23,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:23,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:23,724 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 23:11:23,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:23,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521993482] [2023-08-03 23:11:23,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521993482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:11:23,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:11:23,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:11:23,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584635181] [2023-08-03 23:11:23,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:11:23,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:11:23,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:23,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:11:23,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:11:23,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 225 [2023-08-03 23:11:23,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 23:11:23,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:23,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 225 [2023-08-03 23:11:23,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:25,718 INFO L124 PetriNetUnfolderBase]: 16566/23851 cut-off events. [2023-08-03 23:11:25,718 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2023-08-03 23:11:25,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47099 conditions, 23851 events. 16566/23851 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 155156 event pairs, 12024 based on Foata normal form. 0/20267 useless extension candidates. Maximal degree in co-relation 10385. Up to 22623 conditions per place. [2023-08-03 23:11:25,821 INFO L140 encePairwiseOnDemand]: 221/225 looper letters, 33 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-03 23:11:25,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 178 flow [2023-08-03 23:11:25,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:11:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:11:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-03 23:11:25,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081481481481481 [2023-08-03 23:11:25,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-03 23:11:25,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-03 23:11:25,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:25,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-03 23:11:25,823 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 23:11:25,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 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 23:11:25,824 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 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 23:11:25,824 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 100 flow. Second operand 3 states and 343 transitions. [2023-08-03 23:11:25,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 178 flow [2023-08-03 23:11:25,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 176 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 23:11:25,826 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 108 flow [2023-08-03 23:11:25,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-03 23:11:25,826 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-03 23:11:25,826 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 108 flow [2023-08-03 23:11:25,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 23:11:25,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:25,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:11:25,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 23:11:25,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:11:25,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:25,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1712230363, now seen corresponding path program 1 times [2023-08-03 23:11:25,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:25,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195057145] [2023-08-03 23:11:25,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:25,854 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 23:11:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195057145] [2023-08-03 23:11:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195057145] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:11:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733879730] [2023-08-03 23:11:25,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:25,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:11:25,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:11:25,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:11:25,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 23:11:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:25,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:11:25,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:11:25,935 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 23:11:25,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:11:25,946 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 23:11:25,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733879730] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:11:25,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:11:25,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:11:25,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382968661] [2023-08-03 23:11:25,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:11:25,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:11:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:25,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:11:25,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:11:25,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 225 [2023-08-03 23:11:25,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:25,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:25,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 225 [2023-08-03 23:11:25,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:27,690 INFO L124 PetriNetUnfolderBase]: 13986/19827 cut-off events. [2023-08-03 23:11:27,690 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-08-03 23:11:27,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39138 conditions, 19827 events. 13986/19827 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 123605 event pairs, 9124 based on Foata normal form. 4/16999 useless extension candidates. Maximal degree in co-relation 10383. Up to 18761 conditions per place. [2023-08-03 23:11:27,784 INFO L140 encePairwiseOnDemand]: 221/225 looper letters, 38 selfloop transitions, 3 changer transitions 1/51 dead transitions. [2023-08-03 23:11:27,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 214 flow [2023-08-03 23:11:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:11:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:11:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-08-03 23:11:27,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49666666666666665 [2023-08-03 23:11:27,785 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-08-03 23:11:27,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-08-03 23:11:27,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:27,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-08-03 23:11:27,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:27,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 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 23:11:27,787 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 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 23:11:27,787 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 108 flow. Second operand 4 states and 447 transitions. [2023-08-03 23:11:27,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 214 flow [2023-08-03 23:11:27,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:11:27,789 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 120 flow [2023-08-03 23:11:27,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=4, PETRI_FLOW=120, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-03 23:11:27,789 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-03 23:11:27,789 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 120 flow [2023-08-03 23:11:27,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:27,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:27,790 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:11:27,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-03 23:11:27,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:11:27,994 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:11:27,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash 432941934, now seen corresponding path program 1 times [2023-08-03 23:11:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:27,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096400305] [2023-08-03 23:11:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:28,143 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 23:11:28,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:28,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096400305] [2023-08-03 23:11:28,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096400305] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:11:28,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:11:28,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 23:11:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682790513] [2023-08-03 23:11:28,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:11:28,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:11:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:11:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:11:28,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 225 [2023-08-03 23:11:28,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:28,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:28,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 225 [2023-08-03 23:11:28,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:29,503 INFO L124 PetriNetUnfolderBase]: 12554/17802 cut-off events. [2023-08-03 23:11:29,504 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2023-08-03 23:11:29,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35161 conditions, 17802 events. 12554/17802 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 109721 event pairs, 2538 based on Foata normal form. 0/15535 useless extension candidates. Maximal degree in co-relation 16435. Up to 16065 conditions per place. [2023-08-03 23:11:29,563 INFO L140 encePairwiseOnDemand]: 220/225 looper letters, 43 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-03 23:11:29,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 247 flow [2023-08-03 23:11:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:11:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:11:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-03 23:11:29,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362962962962963 [2023-08-03 23:11:29,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-03 23:11:29,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-03 23:11:29,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:29,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-03 23:11:29,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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 23:11:29,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 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 23:11:29,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 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 23:11:29,566 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 120 flow. Second operand 3 states and 362 transitions. [2023-08-03 23:11:29,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 247 flow [2023-08-03 23:11:29,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 240 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 23:11:29,568 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 134 flow [2023-08-03 23:11:29,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=134, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-03 23:11:29,568 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-03 23:11:29,568 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 134 flow [2023-08-03 23:11:29,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:29,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:29,569 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:11:29,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 23:11:29,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:11:29,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash 432961386, now seen corresponding path program 1 times [2023-08-03 23:11:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:29,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623045] [2023-08-03 23:11:29,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:29,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:29,595 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 23:11:29,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623045] [2023-08-03 23:11:29,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623045] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:11:29,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:11:29,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 23:11:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637929069] [2023-08-03 23:11:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:11:29,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:11:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:11:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:11:29,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 225 [2023-08-03 23:11:29,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 134 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 23:11:29,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:29,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 225 [2023-08-03 23:11:29,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:31,065 INFO L124 PetriNetUnfolderBase]: 12458/17566 cut-off events. [2023-08-03 23:11:31,065 INFO L125 PetriNetUnfolderBase]: For 1241/1241 co-relation queries the response was YES. [2023-08-03 23:11:31,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37261 conditions, 17566 events. 12458/17566 cut-off events. For 1241/1241 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 106955 event pairs, 9330 based on Foata normal form. 0/15322 useless extension candidates. Maximal degree in co-relation 17501. Up to 16513 conditions per place. [2023-08-03 23:11:31,189 INFO L140 encePairwiseOnDemand]: 222/225 looper letters, 43 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-03 23:11:31,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 251 flow [2023-08-03 23:11:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:11:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:11:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-03 23:11:31,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170370370370371 [2023-08-03 23:11:31,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-03 23:11:31,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-03 23:11:31,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:31,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-03 23:11:31,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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 23:11:31,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 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 23:11:31,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 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 23:11:31,195 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 134 flow. Second operand 3 states and 349 transitions. [2023-08-03 23:11:31,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 251 flow [2023-08-03 23:11:31,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:11:31,218 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 143 flow [2023-08-03 23:11:31,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=143, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-08-03 23:11:31,219 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-08-03 23:11:31,219 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 143 flow [2023-08-03 23:11:31,220 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 23:11:31,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:31,220 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:11:31,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 23:11:31,220 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:11:31,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash -629051899, now seen corresponding path program 1 times [2023-08-03 23:11:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:31,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234536722] [2023-08-03 23:11:31,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:11:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234536722] [2023-08-03 23:11:31,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234536722] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:11:31,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703418205] [2023-08-03 23:11:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:11:31,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:11:31,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:11:31,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 23:11:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:31,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:11:31,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:11:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:11:31,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:11:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:11:31,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703418205] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:11:31,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:11:31,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 23:11:31,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66114624] [2023-08-03 23:11:31,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:11:31,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:11:31,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:31,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:11:31,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:11:31,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 225 [2023-08-03 23:11:31,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 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 23:11:31,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:31,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 225 [2023-08-03 23:11:31,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:32,913 INFO L124 PetriNetUnfolderBase]: 11722/16110 cut-off events. [2023-08-03 23:11:32,913 INFO L125 PetriNetUnfolderBase]: For 2065/2065 co-relation queries the response was YES. [2023-08-03 23:11:32,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35582 conditions, 16110 events. 11722/16110 cut-off events. For 2065/2065 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 93273 event pairs, 4546 based on Foata normal form. 80/14714 useless extension candidates. Maximal degree in co-relation 16741. Up to 11009 conditions per place. [2023-08-03 23:11:32,973 INFO L140 encePairwiseOnDemand]: 221/225 looper letters, 60 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2023-08-03 23:11:32,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 345 flow [2023-08-03 23:11:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:11:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:11:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-03 23:11:32,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2023-08-03 23:11:32,975 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-03 23:11:32,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-03 23:11:32,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:32,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-03 23:11:32,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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 23:11:32,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 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 23:11:32,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 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 23:11:32,977 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 143 flow. Second operand 4 states and 464 transitions. [2023-08-03 23:11:32,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 345 flow [2023-08-03 23:11:32,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 343 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:11:32,979 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 161 flow [2023-08-03 23:11:32,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-08-03 23:11:32,979 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2023-08-03 23:11:32,979 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 161 flow [2023-08-03 23:11:32,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 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 23:11:32,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:32,980 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:11:32,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-03 23:11:33,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-03 23:11:33,184 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:11:33,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash 256758108, now seen corresponding path program 1 times [2023-08-03 23:11:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:33,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794552657] [2023-08-03 23:11:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:11:33,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:11:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:11:33,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:11:33,229 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:11:33,230 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 23:11:33,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 23:11:33,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 23:11:33,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 23:11:33,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-03 23:11:33,230 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 23:11:33,230 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 23:11:33,232 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 23:11:33,232 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 23:11:33,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 11:11:33 BasicIcfg [2023-08-03 23:11:33,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 23:11:33,289 INFO L158 Benchmark]: Toolchain (without parser) took 21824.65ms. Allocated memory was 606.1MB in the beginning and 3.0GB in the end (delta: 2.3GB). Free memory was 566.2MB in the beginning and 2.2GB in the end (delta: -1.6GB). Peak memory consumption was 706.1MB. Max. memory is 16.0GB. [2023-08-03 23:11:33,290 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 383.8MB. Free memory is still 337.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 23:11:33,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.69ms. Allocated memory is still 606.1MB. Free memory was 566.2MB in the beginning and 542.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 23:11:33,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.30ms. Allocated memory is still 606.1MB. Free memory was 542.4MB in the beginning and 539.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 23:11:33,290 INFO L158 Benchmark]: Boogie Preprocessor took 22.40ms. Allocated memory is still 606.1MB. Free memory was 539.7MB in the beginning and 537.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:11:33,290 INFO L158 Benchmark]: RCFGBuilder took 572.26ms. Allocated memory is still 606.1MB. Free memory was 537.6MB in the beginning and 556.1MB in the end (delta: -18.5MB). Peak memory consumption was 27.4MB. Max. memory is 16.0GB. [2023-08-03 23:11:33,290 INFO L158 Benchmark]: TraceAbstraction took 20799.01ms. Allocated memory was 606.1MB in the beginning and 3.0GB in the end (delta: 2.3GB). Free memory was 555.2MB in the beginning and 2.2GB in the end (delta: -1.7GB). Peak memory consumption was 693.4MB. Max. memory is 16.0GB. [2023-08-03 23:11:33,291 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.09ms. Allocated memory is still 383.8MB. Free memory is still 337.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 393.69ms. Allocated memory is still 606.1MB. Free memory was 566.2MB in the beginning and 542.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.30ms. Allocated memory is still 606.1MB. Free memory was 542.4MB in the beginning and 539.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.40ms. Allocated memory is still 606.1MB. Free memory was 539.7MB in the beginning and 537.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 572.26ms. Allocated memory is still 606.1MB. Free memory was 537.6MB in the beginning and 556.1MB in the end (delta: -18.5MB). Peak memory consumption was 27.4MB. Max. memory is 16.0GB. * TraceAbstraction took 20799.01ms. Allocated memory was 606.1MB in the beginning and 3.0GB in the end (delta: 2.3GB). Free memory was 555.2MB in the beginning and 2.2GB in the end (delta: -1.7GB). Peak memory consumption was 693.4MB. 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.3s, 84 PlacesBefore, 23 PlacesAfterwards, 80 TransitionsBefore, 18 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 1402 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 867, independent: 776, independent conditional: 0, independent unconditional: 776, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 374, independent: 361, independent conditional: 0, independent unconditional: 361, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 867, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 374, unknown conditional: 0, unknown unconditional: 374] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 22, Positive conditional cache size: 0, Positive unconditional cache size: 22, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 107 PlacesBefore, 44 PlacesAfterwards, 99 TransitionsBefore, 35 TransitionsAfterwards, 2092 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 8735 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3197, independent: 2937, independent conditional: 0, independent unconditional: 2937, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 962, independent: 930, independent conditional: 0, independent unconditional: 930, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3197, independent: 2007, independent conditional: 0, independent unconditional: 2007, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 962, unknown conditional: 0, unknown unconditional: 962] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 130 PlacesBefore, 48 PlacesAfterwards, 125 TransitionsBefore, 40 TransitionsAfterwards, 3896 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 99 TotalNumberOfCompositions, 12785 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4799, independent: 4535, independent conditional: 0, independent unconditional: 4535, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1959, independent: 1910, independent conditional: 0, independent unconditional: 1910, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4799, independent: 2625, independent conditional: 0, independent unconditional: 2625, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 1959, unknown conditional: 0, unknown unconditional: 1959] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 197, Positive conditional cache size: 0, Positive unconditional cache size: 197, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L831] 0 pthread_t t243[2]; [L832] 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, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t243[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(&t243[asdf], ((void *)0), P0, ((void *)0))=-4, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L832] 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, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t243[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(&t243[asdf], ((void *)0), P0, ((void *)0))=-3, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L832] 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, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L832] COND FALSE 0 !(asdf<2) [L833] 0 pthread_t t244[2]; [L834] 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, t243={5:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t244[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(&t244[asdf], ((void *)0), P1, ((void *)0))=-2, t243={5:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L783] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L783] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 3 y$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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L834] 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, t243={5:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t244[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(&t244[asdf], ((void *)0), P1, ((void *)0))=-1, t243={5:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L779] 4 y$w_buff1 = y$w_buff0 [L780] 4 y$w_buff0 = 1 [L781] 4 y$w_buff1_used = y$w_buff0_used [L782] 4 y$w_buff0_used = (_Bool)1 [L783] CALL 4 __VERIFIER_assert(!(y$w_buff1_used && y$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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0, z=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. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 123 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 39 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=54occurred 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, 1/1 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 for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 309 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 2 mSDtfsCounter, 309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=2, InterpolantAutomatonStates: 16, 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.2s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 50/61 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 1 thread instances CFG has 7 procedures, 142 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: 12.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 411 IncrementalHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 10 mSDtfsCounter, 411 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=5, InterpolantAutomatonStates: 17, 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, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 30/36 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 23:11:33,315 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...