/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_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 23:42:37,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 23:42:37,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 23:42:37,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 23:42:37,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 23:42:37,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 23:42:37,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 23:42:37,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 23:42:37,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 23:42:37,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 23:42:37,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 23:42:37,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 23:42:37,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 23:42:37,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 23:42:37,281 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 23:42:37,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 23:42:37,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 23:42:37,282 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 23:42:37,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 23:42:37,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 23:42:37,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 23:42:37,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 23:42:37,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 23:42:37,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 23:42:37,289 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 23:42:37,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 23:42:37,290 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 23:42:37,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 23:42:37,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 23:42:37,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 23:42:37,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:42:37,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 23:42:37,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 23:42:37,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 23:42:37,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 23:42:37,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 23:42:37,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 23:42:37,292 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 23:42:37,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 23:42:37,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 23:42:37,293 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 23:42:37,293 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:42:37,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 23:42:37,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 23:42:37,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 23:42:37,488 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 23:42:37,489 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 23:42:37,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 23:42:38,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 23:42:38,552 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 23:42:38,553 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 23:42:38,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da6edd58/433810b20b954437a1a4b9369161f428/FLAGa1241fd74 [2023-08-03 23:42:38,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da6edd58/433810b20b954437a1a4b9369161f428 [2023-08-03 23:42:38,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 23:42:38,577 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 23:42:38,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 23:42:38,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 23:42:38,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 23:42:38,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:38,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1898048d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38, skipping insertion in model container [2023-08-03 23:42:38,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:38,618 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 23:42:38,733 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_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i[983,996] [2023-08-03 23:42:38,872 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:42:38,879 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 23:42:38,888 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_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i[983,996] [2023-08-03 23:42:38,906 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 23:42:38,907 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 23:42:38,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:42:38,965 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:42:38,965 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:42:38,970 INFO L206 MainTranslator]: Completed translation [2023-08-03 23:42:38,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38 WrapperNode [2023-08-03 23:42:38,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 23:42:38,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 23:42:38,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 23:42:38,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 23:42:38,976 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:42:38" (1/1) ... [2023-08-03 23:42:38,987 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:42:38" (1/1) ... [2023-08-03 23:42:39,004 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-08-03 23:42:39,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 23:42:39,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 23:42:39,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 23:42:39,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 23:42:39,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:39,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:39,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:39,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:39,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:39,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:39,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:39,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:39,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 23:42:39,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 23:42:39,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 23:42:39,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 23:42:39,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38" (1/1) ... [2023-08-03 23:42:39,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:42:39,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:42:39,104 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:42:39,112 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:42:39,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 23:42:39,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 23:42:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 23:42:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 23:42:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 23:42:39,137 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 23:42:39,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 23:42:39,137 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 23:42:39,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 23:42:39,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 23:42:39,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 23:42:39,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 23:42:39,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 23:42:39,139 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:42:39,263 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 23:42:39,264 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 23:42:39,516 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 23:42:39,590 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 23:42:39,590 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 23:42:39,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:42:39 BoogieIcfgContainer [2023-08-03 23:42:39,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 23:42:39,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 23:42:39,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 23:42:39,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 23:42:39,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 11:42:38" (1/3) ... [2023-08-03 23:42:39,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be998f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:42:39, skipping insertion in model container [2023-08-03 23:42:39,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:42:38" (2/3) ... [2023-08-03 23:42:39,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be998f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:42:39, skipping insertion in model container [2023-08-03 23:42:39,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:42:39" (3/3) ... [2023-08-03 23:42:39,635 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 23:42:39,640 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 23:42:39,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 23:42:39,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 23:42:39,646 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 23:42:39,672 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:42:39,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 23:42:39,755 INFO L124 PetriNetUnfolderBase]: 14/223 cut-off events. [2023-08-03 23:42:39,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:42:39,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 223 events. 14/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 628 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2023-08-03 23:42:39,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 23:42:39,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 78 transitions, 166 flow [2023-08-03 23:42:39,764 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:42:39,769 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-03 23:42:39,770 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-03 23:42:39,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 78 transitions, 166 flow [2023-08-03 23:42:39,784 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2023-08-03 23:42:39,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:42:39,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 166 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 4 conditions per place. [2023-08-03 23:42:39,785 INFO L119 LiptonReduction]: Number of co-enabled transitions 690 [2023-08-03 23:42:41,824 INFO L134 LiptonReduction]: Checked pairs total: 1693 [2023-08-03 23:42:41,824 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-08-03 23:42:41,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:42:41,837 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;@7636d158, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:42:41,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:42:41,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:42:41,840 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-03 23:42:41,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:42:41,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:41,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:42:41,841 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:42:41,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:41,844 INFO L85 PathProgramCache]: Analyzing trace with hash 425346853, now seen corresponding path program 1 times [2023-08-03 23:42:41,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:41,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809602375] [2023-08-03 23:42:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:42,000 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:42:42,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:42:42,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809602375] [2023-08-03 23:42:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809602375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:42:42,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:42:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:42:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696330272] [2023-08-03 23:42:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:42:42,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:42:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:42:42,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:42:42,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:42:42,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 170 [2023-08-03 23:42:42,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:42:42,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:42:42,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 170 [2023-08-03 23:42:42,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:42:42,102 INFO L124 PetriNetUnfolderBase]: 65/140 cut-off events. [2023-08-03 23:42:42,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:42:42,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 140 events. 65/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 499 event pairs, 20 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 273. Up to 126 conditions per place. [2023-08-03 23:42:42,105 INFO L140 encePairwiseOnDemand]: 167/170 looper letters, 17 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-08-03 23:42:42,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 92 flow [2023-08-03 23:42:42,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:42:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:42:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-08-03 23:42:42,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5568627450980392 [2023-08-03 23:42:42,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-08-03 23:42:42,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-08-03 23:42:42,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:42:42,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-08-03 23:42:42,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:42:42,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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:42:42,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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:42:42,131 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 284 transitions. [2023-08-03 23:42:42,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 92 flow [2023-08-03 23:42:42,133 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:42:42,134 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-03 23:42:42,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, 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:42:42,137 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-03 23:42:42,137 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-03 23:42:42,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:42:42,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:42,138 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 23:42:42,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 23:42:42,138 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:42:42,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash 290748501, now seen corresponding path program 1 times [2023-08-03 23:42:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:42,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41782024] [2023-08-03 23:42:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:42,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:42:42,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:42:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:42:42,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:42:42,205 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:42:42,206 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:42:42,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:42:42,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 23:42:42,209 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 23:42:42,211 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-03 23:42:42,212 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 23:42:42,212 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 23:42:42,231 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:42:42,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 23:42:42,265 INFO L124 PetriNetUnfolderBase]: 30/464 cut-off events. [2023-08-03 23:42:42,266 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:42:42,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 464 events. 30/464 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1982 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 333. Up to 18 conditions per place. [2023-08-03 23:42:42,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 23:42:42,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 218 flow [2023-08-03 23:42:42,268 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:42:42,268 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 218 flow [2023-08-03 23:42:42,269 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 218 flow [2023-08-03 23:42:42,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 218 flow [2023-08-03 23:42:42,285 INFO L124 PetriNetUnfolderBase]: 3/221 cut-off events. [2023-08-03 23:42:42,285 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:42:42,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 221 events. 3/221 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 574 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 171. Up to 9 conditions per place. [2023-08-03 23:42:42,287 INFO L119 LiptonReduction]: Number of co-enabled transitions 2020 [2023-08-03 23:42:44,228 INFO L134 LiptonReduction]: Checked pairs total: 7474 [2023-08-03 23:42:44,228 INFO L136 LiptonReduction]: Total number of compositions: 68 [2023-08-03 23:42:44,230 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:42:44,230 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;@7636d158, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:42:44,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:42:44,234 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:42:44,234 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2023-08-03 23:42:44,234 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 23:42:44,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:44,234 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-03 23:42:44,234 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:42:44,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1506470958, now seen corresponding path program 1 times [2023-08-03 23:42:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:44,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051650499] [2023-08-03 23:42:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:44,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:44,271 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:42:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:42:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051650499] [2023-08-03 23:42:44,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051650499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:42:44,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:42:44,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:42:44,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770186002] [2023-08-03 23:42:44,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:42:44,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:42:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:42:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:42:44,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:42:44,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 192 [2023-08-03 23:42:44,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:42:44,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:42:44,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 192 [2023-08-03 23:42:44,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:42:44,744 INFO L124 PetriNetUnfolderBase]: 2993/4901 cut-off events. [2023-08-03 23:42:44,744 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-08-03 23:42:44,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9672 conditions, 4901 events. 2993/4901 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 31728 event pairs, 2036 based on Foata normal form. 0/4309 useless extension candidates. Maximal degree in co-relation 2121. Up to 4270 conditions per place. [2023-08-03 23:42:44,769 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 26 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-03 23:42:44,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 160 flow [2023-08-03 23:42:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:42:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:42:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-08-03 23:42:44,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2023-08-03 23:42:44,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-08-03 23:42:44,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-08-03 23:42:44,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:42:44,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-08-03 23:42:44,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:42:44,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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:42:44,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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:42:44,773 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 94 flow. Second operand 3 states and 332 transitions. [2023-08-03 23:42:44,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 160 flow [2023-08-03 23:42:44,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 156 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 23:42:44,777 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 102 flow [2023-08-03 23:42:44,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, 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:42:44,778 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-08-03 23:42:44,778 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 102 flow [2023-08-03 23:42:44,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:42:44,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:44,779 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 23:42:44,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 23:42:44,779 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:42:44,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2084725457, now seen corresponding path program 1 times [2023-08-03 23:42:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:44,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566729188] [2023-08-03 23:42:44,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:44,867 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:42:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:42:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566729188] [2023-08-03 23:42:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566729188] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:42:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081747519] [2023-08-03 23:42:44,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:44,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:42:44,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:42:44,871 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:42:44,904 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:42:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:44,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:42:44,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:42:44,986 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:42:44,986 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:42:44,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081747519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:42:44,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:42:44,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:42:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755793954] [2023-08-03 23:42:44,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:42:44,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:42:44,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:42:44,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:42:44,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 23:42:44,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 192 [2023-08-03 23:42:44,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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:42:44,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:42:45,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 192 [2023-08-03 23:42:45,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:42:45,355 INFO L124 PetriNetUnfolderBase]: 2969/5025 cut-off events. [2023-08-03 23:42:45,355 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2023-08-03 23:42:45,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9747 conditions, 5025 events. 2969/5025 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 33882 event pairs, 1280 based on Foata normal form. 16/4481 useless extension candidates. Maximal degree in co-relation 2585. Up to 4187 conditions per place. [2023-08-03 23:42:45,376 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 31 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-03 23:42:45,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 192 flow [2023-08-03 23:42:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:42:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:42:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-08-03 23:42:45,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2023-08-03 23:42:45,378 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-08-03 23:42:45,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-08-03 23:42:45,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:42:45,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-08-03 23:42:45,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 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:42:45,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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:42:45,381 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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:42:45,381 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 102 flow. Second operand 5 states and 536 transitions. [2023-08-03 23:42:45,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 192 flow [2023-08-03 23:42:45,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 23:42:45,383 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 116 flow [2023-08-03 23:42:45,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, 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:42:45,383 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-08-03 23:42:45,383 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 116 flow [2023-08-03 23:42:45,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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:42:45,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:45,384 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:42:45,391 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:42:45,592 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:42:45,592 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:42:45,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash 585454679, now seen corresponding path program 1 times [2023-08-03 23:42:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989997242] [2023-08-03 23:42:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:45,630 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:42:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:42:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989997242] [2023-08-03 23:42:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989997242] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:42:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670545598] [2023-08-03 23:42:45,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:45,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:42:45,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:42:45,635 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:42:45,651 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:42:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:45,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:42:45,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:42:45,711 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:42:45,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:42:45,726 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:42:45,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670545598] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:42:45,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:42:45,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:42:45,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447842230] [2023-08-03 23:42:45,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:42:45,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:42:45,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:42:45,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:42:45,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:42:45,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 192 [2023-08-03 23:42:45,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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:42:45,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:42:45,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 192 [2023-08-03 23:42:45,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:42:46,087 INFO L124 PetriNetUnfolderBase]: 2530/4186 cut-off events. [2023-08-03 23:42:46,087 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2023-08-03 23:42:46,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8192 conditions, 4186 events. 2530/4186 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 26524 event pairs, 1024 based on Foata normal form. 4/3742 useless extension candidates. Maximal degree in co-relation 2153. Up to 3505 conditions per place. [2023-08-03 23:42:46,102 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 31 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-03 23:42:46,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 198 flow [2023-08-03 23:42:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:42:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:42:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-03 23:42:46,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.56640625 [2023-08-03 23:42:46,104 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-03 23:42:46,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-03 23:42:46,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:42:46,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-03 23:42:46,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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:42:46,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 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:42:46,106 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 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:42:46,106 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 116 flow. Second operand 4 states and 435 transitions. [2023-08-03 23:42:46,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 198 flow [2023-08-03 23:42:46,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 193 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 23:42:46,109 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 109 flow [2023-08-03 23:42:46,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, 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:42:46,110 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-08-03 23:42:46,110 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 109 flow [2023-08-03 23:42:46,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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:42:46,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:46,111 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:42:46,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 23:42:46,317 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:42:46,318 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:42:46,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash 531772097, now seen corresponding path program 1 times [2023-08-03 23:42:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:46,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760631873] [2023-08-03 23:42:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:46,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:46,353 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:42:46,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:42:46,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760631873] [2023-08-03 23:42:46,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760631873] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:42:46,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641010113] [2023-08-03 23:42:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:46,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:42:46,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:42:46,355 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:42:46,357 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:42:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:46,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:42:46,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:42:46,439 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:42:46,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:42:46,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641010113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:42:46,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:42:46,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:42:46,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475548522] [2023-08-03 23:42:46,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:42:46,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:42:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:42:46,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:42:46,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:42:46,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 192 [2023-08-03 23:42:46,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:42:46,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:42:46,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 192 [2023-08-03 23:42:46,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:42:46,625 INFO L124 PetriNetUnfolderBase]: 1290/2311 cut-off events. [2023-08-03 23:42:46,625 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2023-08-03 23:42:46,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4617 conditions, 2311 events. 1290/2311 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13955 event pairs, 42 based on Foata normal form. 400/2503 useless extension candidates. Maximal degree in co-relation 2109. Up to 1584 conditions per place. [2023-08-03 23:42:46,630 INFO L140 encePairwiseOnDemand]: 190/192 looper letters, 0 selfloop transitions, 0 changer transitions 50/50 dead transitions. [2023-08-03 23:42:46,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 217 flow [2023-08-03 23:42:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:42:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:42:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2023-08-03 23:42:46,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.578125 [2023-08-03 23:42:46,631 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 444 transitions. [2023-08-03 23:42:46,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 444 transitions. [2023-08-03 23:42:46,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:42:46,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 444 transitions. [2023-08-03 23:42:46,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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:42:46,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 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:42:46,634 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 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:42:46,634 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 109 flow. Second operand 4 states and 444 transitions. [2023-08-03 23:42:46,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 217 flow [2023-08-03 23:42:46,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 23:42:46,636 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2023-08-03 23:42:46,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, 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:42:46,637 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-08-03 23:42:46,637 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2023-08-03 23:42:46,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:42:46,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:42:46,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:42:46,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 23:42:46,842 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:42:46,843 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-03 23:42:46,843 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-03 23:42:46,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 23:42:46,869 INFO L124 PetriNetUnfolderBase]: 30/464 cut-off events. [2023-08-03 23:42:46,869 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:42:46,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 464 events. 30/464 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1982 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 333. Up to 18 conditions per place. [2023-08-03 23:42:46,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 23:42:46,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 123 transitions, 266 flow [2023-08-03 23:42:46,870 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:42:46,875 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 123 transitions, 266 flow [2023-08-03 23:42:46,876 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 123 transitions, 266 flow [2023-08-03 23:42:46,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 123 transitions, 266 flow [2023-08-03 23:42:46,900 INFO L124 PetriNetUnfolderBase]: 30/463 cut-off events. [2023-08-03 23:42:46,901 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-03 23:42:46,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 463 events. 30/463 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1970 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 332. Up to 18 conditions per place. [2023-08-03 23:42:46,905 INFO L119 LiptonReduction]: Number of co-enabled transitions 3828 [2023-08-03 23:42:49,293 INFO L134 LiptonReduction]: Checked pairs total: 14092 [2023-08-03 23:42:49,293 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-03 23:42:49,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 23:42:49,295 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;@7636d158, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:42:49,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 23:42:49,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:42:49,296 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-03 23:42:49,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:42:49,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:49,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:42:49,296 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:42:49,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:49,297 INFO L85 PathProgramCache]: Analyzing trace with hash 718859330, now seen corresponding path program 1 times [2023-08-03 23:42:49,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:49,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594032833] [2023-08-03 23:42:49,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:49,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:49,313 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:42:49,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:42:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594032833] [2023-08-03 23:42:49,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594032833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:42:49,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:42:49,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:42:49,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825551398] [2023-08-03 23:42:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:42:49,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:42:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:42:49,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:42:49,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:42:49,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2023-08-03 23:42:49,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:42:49,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:42:49,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2023-08-03 23:42:49,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:42:50,865 INFO L124 PetriNetUnfolderBase]: 15012/23340 cut-off events. [2023-08-03 23:42:50,866 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2023-08-03 23:42:50,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44494 conditions, 23340 events. 15012/23340 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 169462 event pairs, 10800 based on Foata normal form. 620/19776 useless extension candidates. Maximal degree in co-relation 9789. Up to 20629 conditions per place. [2023-08-03 23:42:50,943 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 33 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-03 23:42:50,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 182 flow [2023-08-03 23:42:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:42:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:42:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-03 23:42:50,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2023-08-03 23:42:50,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-03 23:42:50,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-03 23:42:50,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:42:50,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-03 23:42:50,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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:42:50,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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:42:50,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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:42:50,947 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 104 flow. Second operand 3 states and 340 transitions. [2023-08-03 23:42:50,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 182 flow [2023-08-03 23:42:50,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 180 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 23:42:50,948 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 112 flow [2023-08-03 23:42:50,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-03 23:42:50,948 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-03 23:42:50,948 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 112 flow [2023-08-03 23:42:50,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:42:50,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:50,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:42:50,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 23:42:50,949 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:42:50,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash 791055526, now seen corresponding path program 1 times [2023-08-03 23:42:50,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:50,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057497823] [2023-08-03 23:42:50,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:50,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:50,990 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:42:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:42:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057497823] [2023-08-03 23:42:50,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057497823] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:42:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227331736] [2023-08-03 23:42:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:50,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:42:50,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:42:50,991 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:42:50,993 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:42:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:51,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:42:51,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:42:51,072 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:42:51,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:42:51,080 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:42:51,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227331736] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:42:51,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:42:51,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-03 23:42:51,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84045366] [2023-08-03 23:42:51,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:42:51,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:42:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:42:51,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:42:51,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 23:42:51,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 221 [2023-08-03 23:42:51,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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:42:51,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:42:51,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 221 [2023-08-03 23:42:51,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:42:52,316 INFO L124 PetriNetUnfolderBase]: 12690/19422 cut-off events. [2023-08-03 23:42:52,316 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-03 23:42:52,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37021 conditions, 19422 events. 12690/19422 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 134769 event pairs, 5964 based on Foata normal form. 4/16114 useless extension candidates. Maximal degree in co-relation 9809. Up to 17113 conditions per place. [2023-08-03 23:42:52,381 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 38 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2023-08-03 23:42:52,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 218 flow [2023-08-03 23:42:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:42:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:42:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 443 transitions. [2023-08-03 23:42:52,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501131221719457 [2023-08-03 23:42:52,383 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 443 transitions. [2023-08-03 23:42:52,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 443 transitions. [2023-08-03 23:42:52,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:42:52,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 443 transitions. [2023-08-03 23:42:52,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 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:42:52,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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:42:52,385 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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:42:52,385 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 112 flow. Second operand 4 states and 443 transitions. [2023-08-03 23:42:52,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 218 flow [2023-08-03 23:42:52,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:42:52,386 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 124 flow [2023-08-03 23:42:52,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-03 23:42:52,387 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-03 23:42:52,387 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 124 flow [2023-08-03 23:42:52,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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:42:52,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:52,387 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:42:52,391 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:42:52,591 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:42:52,592 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:42:52,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1309382219, now seen corresponding path program 1 times [2023-08-03 23:42:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465286156] [2023-08-03 23:42:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:52,729 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:42:52,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:42:52,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465286156] [2023-08-03 23:42:52,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465286156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:42:52,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:42:52,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 23:42:52,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940345264] [2023-08-03 23:42:52,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:42:52,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:42:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:42:52,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:42:52,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:42:52,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 221 [2023-08-03 23:42:52,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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:42:52,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:42:52,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 221 [2023-08-03 23:42:52,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:42:53,923 INFO L124 PetriNetUnfolderBase]: 10842/16983 cut-off events. [2023-08-03 23:42:53,923 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2023-08-03 23:42:53,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32102 conditions, 16983 events. 10842/16983 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 118572 event pairs, 2106 based on Foata normal form. 0/14247 useless extension candidates. Maximal degree in co-relation 15029. Up to 13633 conditions per place. [2023-08-03 23:42:53,985 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 45 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-03 23:42:53,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 259 flow [2023-08-03 23:42:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:42:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:42:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-03 23:42:53,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444947209653092 [2023-08-03 23:42:53,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-03 23:42:53,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-03 23:42:53,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:42:53,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-03 23:42:53,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:42:53,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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:42:53,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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:42:53,989 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 124 flow. Second operand 3 states and 361 transitions. [2023-08-03 23:42:53,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 259 flow [2023-08-03 23:42:53,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 252 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 23:42:53,990 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 138 flow [2023-08-03 23:42:53,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=117, 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=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-08-03 23:42:53,990 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-03 23:42:53,990 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 138 flow [2023-08-03 23:42:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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:42:53,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:53,991 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:42:53,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 23:42:53,991 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:42:53,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:53,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1936677540, now seen corresponding path program 1 times [2023-08-03 23:42:53,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:53,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835591879] [2023-08-03 23:42:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:53,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:42:54,022 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:42:54,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:42:54,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835591879] [2023-08-03 23:42:54,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835591879] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:42:54,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:42:54,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 23:42:54,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825109800] [2023-08-03 23:42:54,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:42:54,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:42:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:42:54,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:42:54,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:42:54,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2023-08-03 23:42:54,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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:42:54,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:42:54,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2023-08-03 23:42:54,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:42:55,016 INFO L124 PetriNetUnfolderBase]: 10698/16023 cut-off events. [2023-08-03 23:42:55,017 INFO L125 PetriNetUnfolderBase]: For 1289/1289 co-relation queries the response was YES. [2023-08-03 23:42:55,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33510 conditions, 16023 events. 10698/16023 cut-off events. For 1289/1289 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 108563 event pairs, 8154 based on Foata normal form. 0/13583 useless extension candidates. Maximal degree in co-relation 15757. Up to 14281 conditions per place. [2023-08-03 23:42:55,082 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 42 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-03 23:42:55,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 251 flow [2023-08-03 23:42:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:42:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:42:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-03 23:42:55,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521870286576169 [2023-08-03 23:42:55,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-03 23:42:55,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-03 23:42:55,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:42:55,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-03 23:42:55,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:42:55,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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:42:55,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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:42:55,085 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 138 flow. Second operand 3 states and 346 transitions. [2023-08-03 23:42:55,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 251 flow [2023-08-03 23:42:55,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:42:55,087 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 149 flow [2023-08-03 23:42:55,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-03 23:42:55,087 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2023-08-03 23:42:55,087 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 149 flow [2023-08-03 23:42:55,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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:42:55,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:42:55,088 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:42:55,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 23:42:55,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:42:55,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:42:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1405934192, now seen corresponding path program 1 times [2023-08-03 23:42:55,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:42:55,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732947924] [2023-08-03 23:42:55,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:42:55,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:42:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:42:55,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:42:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:42:55,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:42:55,111 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:42:55,111 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 23:42:55,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 23:42:55,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 23:42:55,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 23:42:55,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-03 23:42:55,111 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-03 23:42:55,112 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 23:42:55,114 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 23:42:55,114 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 23:42:55,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 11:42:55 BasicIcfg [2023-08-03 23:42:55,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 23:42:55,163 INFO L158 Benchmark]: Toolchain (without parser) took 16586.49ms. Allocated memory was 572.5MB in the beginning and 1.8GB in the end (delta: 1.2GB). Free memory was 532.8MB in the beginning and 1.5GB in the end (delta: -981.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-03 23:42:55,163 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 354.4MB. Free memory was 306.0MB in the beginning and 305.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 23:42:55,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.50ms. Allocated memory is still 572.5MB. Free memory was 532.4MB in the beginning and 509.8MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 23:42:55,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.47ms. Allocated memory is still 572.5MB. Free memory was 509.8MB in the beginning and 507.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:42:55,164 INFO L158 Benchmark]: Boogie Preprocessor took 37.65ms. Allocated memory is still 572.5MB. Free memory was 507.1MB in the beginning and 505.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:42:55,164 INFO L158 Benchmark]: RCFGBuilder took 545.18ms. Allocated memory is still 572.5MB. Free memory was 505.0MB in the beginning and 471.7MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-03 23:42:55,164 INFO L158 Benchmark]: TraceAbstraction took 15534.49ms. Allocated memory was 572.5MB in the beginning and 1.8GB in the end (delta: 1.2GB). Free memory was 538.4MB in the beginning and 1.5GB in the end (delta: -976.0MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-03 23:42:55,165 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 354.4MB. Free memory was 306.0MB in the beginning and 305.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 393.50ms. Allocated memory is still 572.5MB. Free memory was 532.4MB in the beginning and 509.8MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.47ms. Allocated memory is still 572.5MB. Free memory was 509.8MB in the beginning and 507.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.65ms. Allocated memory is still 572.5MB. Free memory was 507.1MB in the beginning and 505.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 545.18ms. Allocated memory is still 572.5MB. Free memory was 505.0MB in the beginning and 471.7MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 15534.49ms. Allocated memory was 572.5MB in the beginning and 1.8GB in the end (delta: 1.2GB). Free memory was 538.4MB in the beginning and 1.5GB in the end (delta: -976.0MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 82 PlacesBefore, 23 PlacesAfterwards, 78 TransitionsBefore, 18 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 1693 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 993, independent: 899, independent conditional: 0, independent unconditional: 899, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 371, independent: 361, independent conditional: 0, independent unconditional: 361, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 993, independent: 538, independent conditional: 0, independent unconditional: 538, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 371, unknown conditional: 0, unknown unconditional: 371] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 105 PlacesBefore, 44 PlacesAfterwards, 97 TransitionsBefore, 35 TransitionsAfterwards, 2020 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 7474 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2983, independent: 2756, independent conditional: 0, independent unconditional: 2756, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 942, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2983, independent: 1840, independent conditional: 0, independent unconditional: 1840, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 942, unknown conditional: 0, unknown unconditional: 942] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 128 PlacesBefore, 50 PlacesAfterwards, 123 TransitionsBefore, 42 TransitionsAfterwards, 3828 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 97 TotalNumberOfCompositions, 14092 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5062, independent: 4754, independent conditional: 0, independent unconditional: 4754, dependent: 308, dependent conditional: 0, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1882, independent: 1845, independent conditional: 0, independent unconditional: 1845, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5062, independent: 2909, independent conditional: 0, independent unconditional: 2909, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 1882, unknown conditional: 0, unknown unconditional: 1882] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 223, Positive conditional cache size: 0, Positive unconditional cache size: 223, 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091[2]; [L803] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L803] COND TRUE 0 asdf<2 [L803] FCALL, FORK 0 pthread_create(&t1091[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091[asdf], ((void *)0), P0, ((void *)0))=-3, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L803] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L803] COND TRUE 0 asdf<2 [L803] FCALL, FORK 0 pthread_create(&t1091[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091[asdf], ((void *)0), P0, ((void *)0))=-2, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L803] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L803] COND FALSE 0 !(asdf<2) [L804] 0 pthread_t t1092[2]; [L805] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L805] COND TRUE 0 asdf<2 [L805] FCALL, FORK 0 pthread_create(&t1092[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t1092[asdf], ((void *)0), P1, ((void *)0))=-1, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L760] 3 x$w_buff1 = x$w_buff0 [L761] 3 x$w_buff0 = 2 [L762] 3 x$w_buff1_used = x$w_buff0_used [L763] 3 x$w_buff0_used = (_Bool)1 [L764] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L764] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L805] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L805] COND TRUE 0 asdf<2 [L805] FCALL, FORK 0 pthread_create(&t1092[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t1092[asdf], ((void *)0), P1, ((void *)0))=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L760] 4 x$w_buff1 = x$w_buff0 [L761] 4 x$w_buff0 = 2 [L762] 4 x$w_buff1_used = x$w_buff0_used [L763] 4 x$w_buff0_used = (_Bool)1 [L764] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=0, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 121 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.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 36 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, 140 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: 4.6s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 274 IncrementalHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2 mSDtfsCounter, 274 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, 472 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, 140 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: 8.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 288 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 3 mSDtfsCounter, 288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/15 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:42:55,181 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...