/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 PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:49:40,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:49:41,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:49:41,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:49:41,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:49:41,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:49:41,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:49:41,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:49:41,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:49:41,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:49:41,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:49:41,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:49:41,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:49:41,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:49:41,084 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:49:41,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:49:41,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:49:41,085 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:49:41,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:49:41,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:49:41,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:49:41,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:49:41,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:49:41,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:49:41,090 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:49:41,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:49:41,091 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:49:41,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:49:41,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:49:41,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:49:41,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:49:41,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:49:41,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:49:41,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:49:41,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:49:41,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:49:41,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:49:41,094 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:49:41,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:49:41,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:49:41,094 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:49:41,094 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 -> PROGRAM_FIRST [2023-08-04 05:49:41,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:49:41,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:49:41,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:49:41,326 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:49:41,328 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:49:41,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt_bound2.i [2023-08-04 05:49:42,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:49:42,709 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:49:42,710 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt_bound2.i [2023-08-04 05:49:42,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba1c8c256/2f4466480e8e4c7cb6437da6de78ad18/FLAGa18fb721b [2023-08-04 05:49:42,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba1c8c256/2f4466480e8e4c7cb6437da6de78ad18 [2023-08-04 05:49:42,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:49:42,742 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:49:42,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:49:42,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:49:42,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:49:42,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:49:42" (1/1) ... [2023-08-04 05:49:42,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bde9800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:42, skipping insertion in model container [2023-08-04 05:49:42,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:49:42" (1/1) ... [2023-08-04 05:49:42,798 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:49:42,953 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_mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt_bound2.i[986,999] [2023-08-04 05:49:43,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:49:43,209 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:49:43,221 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_mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt_bound2.i[986,999] [2023-08-04 05:49:43,240 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:49:43,242 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:49:43,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:49:43,324 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:49:43,324 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:49:43,330 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:49:43,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43 WrapperNode [2023-08-04 05:49:43,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:49:43,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:49:43,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:49:43,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:49:43,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,412 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-08-04 05:49:43,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:49:43,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:49:43,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:49:43,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:49:43,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:49:43,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:49:43,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:49:43,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:49:43,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (1/1) ... [2023-08-04 05:49:43,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:49:43,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:49:43,484 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-04 05:49:43,509 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-04 05:49:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:49:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:49:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:49:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:49:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:49:43,536 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 05:49:43,664 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:49:43,665 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:49:43,905 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:49:44,034 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:49:44,035 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:49:44,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:49:44 BoogieIcfgContainer [2023-08-04 05:49:44,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:49:44,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:49:44,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:49:44,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:49:44,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:49:42" (1/3) ... [2023-08-04 05:49:44,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea94cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:49:44, skipping insertion in model container [2023-08-04 05:49:44,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:43" (2/3) ... [2023-08-04 05:49:44,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea94cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:49:44, skipping insertion in model container [2023-08-04 05:49:44,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:49:44" (3/3) ... [2023-08-04 05:49:44,045 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt_bound2.i [2023-08-04 05:49:44,063 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:49:44,072 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:49:44,072 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:49:44,072 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:49:44,134 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:49:44,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 135 transitions, 285 flow [2023-08-04 05:49:44,323 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-04 05:49:44,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:44,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 30/457 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2016 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-04 05:49:44,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 135 transitions, 285 flow [2023-08-04 05:49:44,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 135 transitions, 285 flow [2023-08-04 05:49:44,342 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:49:44,353 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 135 transitions, 285 flow [2023-08-04 05:49:44,356 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 135 transitions, 285 flow [2023-08-04 05:49:44,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 135 transitions, 285 flow [2023-08-04 05:49:44,420 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-04 05:49:44,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:44,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 30/457 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2016 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-04 05:49:44,429 INFO L119 LiptonReduction]: Number of co-enabled transitions 3172 [2023-08-04 05:49:47,996 INFO L134 LiptonReduction]: Checked pairs total: 8937 [2023-08-04 05:49:47,997 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-04 05:49:48,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:49:48,013 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;@315019bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:49:48,013 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:49:48,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:49:48,017 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-04 05:49:48,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:48,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:48,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:49:48,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:49:48,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash 17882887, now seen corresponding path program 1 times [2023-08-04 05:49:48,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:48,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332762994] [2023-08-04 05:49:48,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:48,382 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-04 05:49:48,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:48,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332762994] [2023-08-04 05:49:48,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332762994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:48,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:49:48,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:49:48,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020421329] [2023-08-04 05:49:48,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:48,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:48,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:48,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:49:48,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 249 [2023-08-04 05:49:48,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-04 05:49:48,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:48,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 249 [2023-08-04 05:49:48,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:49,083 INFO L124 PetriNetUnfolderBase]: 3074/5132 cut-off events. [2023-08-04 05:49:49,084 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-04 05:49:49,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9987 conditions, 5132 events. 3074/5132 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 32957 event pairs, 650 based on Foata normal form. 180/4714 useless extension candidates. Maximal degree in co-relation 8705. Up to 3553 conditions per place. [2023-08-04 05:49:49,122 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 45 selfloop transitions, 2 changer transitions 8/58 dead transitions. [2023-08-04 05:49:49,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 241 flow [2023-08-04 05:49:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:49:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:49:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-04 05:49:49,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5475234270414994 [2023-08-04 05:49:49,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-04 05:49:49,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-04 05:49:49,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:49,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-04 05:49:49,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-04 05:49:49,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-04 05:49:49,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-04 05:49:49,162 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 89 flow. Second operand 3 states and 409 transitions. [2023-08-04 05:49:49,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 241 flow [2023-08-04 05:49:49,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 241 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:49:49,168 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 73 flow [2023-08-04 05:49:49,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-04 05:49:49,173 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-08-04 05:49:49,173 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 73 flow [2023-08-04 05:49:49,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-04 05:49:49,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:49,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:49,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:49:49,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:49:49,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash 371255242, now seen corresponding path program 1 times [2023-08-04 05:49:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:49,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848200260] [2023-08-04 05:49:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:49,287 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-04 05:49:49,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848200260] [2023-08-04 05:49:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848200260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:49,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:49:49,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:49:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496926072] [2023-08-04 05:49:49,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:49,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:49,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:49:49,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 249 [2023-08-04 05:49:49,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-04 05:49:49,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:49,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 249 [2023-08-04 05:49:49,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:49,675 INFO L124 PetriNetUnfolderBase]: 2129/3402 cut-off events. [2023-08-04 05:49:49,676 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-08-04 05:49:49,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 3402 events. 2129/3402 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 18429 event pairs, 1245 based on Foata normal form. 0/3187 useless extension candidates. Maximal degree in co-relation 6919. Up to 3235 conditions per place. [2023-08-04 05:49:49,698 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 29 selfloop transitions, 2 changer transitions 1/35 dead transitions. [2023-08-04 05:49:49,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 149 flow [2023-08-04 05:49:49,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:49:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:49:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-04 05:49:49,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2023-08-04 05:49:49,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-04 05:49:49,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-04 05:49:49,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:49,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-04 05:49:49,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-04 05:49:49,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-04 05:49:49,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-04 05:49:49,704 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 73 flow. Second operand 3 states and 378 transitions. [2023-08-04 05:49:49,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 149 flow [2023-08-04 05:49:49,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:49:49,706 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 77 flow [2023-08-04 05:49:49,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-04 05:49:49,707 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-04 05:49:49,707 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 77 flow [2023-08-04 05:49:49,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-04 05:49:49,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:49,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:49,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 05:49:49,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:49:49,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1510761987, now seen corresponding path program 1 times [2023-08-04 05:49:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606280962] [2023-08-04 05:49:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:49,759 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-04 05:49:49,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:49,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606280962] [2023-08-04 05:49:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606280962] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:49:49,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544382332] [2023-08-04 05:49:49,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:49,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:49,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:49:49,763 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-04 05:49:49,783 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-04 05:49:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:49,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:49:49,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:49:49,895 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-04 05:49:49,895 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:49:49,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544382332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:49:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:49:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114192982] [2023-08-04 05:49:49,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:49,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:49,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:49,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:49:49,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 249 [2023-08-04 05:49:49,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-04 05:49:49,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:49,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 249 [2023-08-04 05:49:49,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:50,249 INFO L124 PetriNetUnfolderBase]: 1845/2880 cut-off events. [2023-08-04 05:49:50,249 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 05:49:50,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 2880 events. 1845/2880 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14853 event pairs, 1176 based on Foata normal form. 0/2720 useless extension candidates. Maximal degree in co-relation 5691. Up to 2699 conditions per place. [2023-08-04 05:49:50,264 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 32 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2023-08-04 05:49:50,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 163 flow [2023-08-04 05:49:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:49:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:49:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-04 05:49:50,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100401606425703 [2023-08-04 05:49:50,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-04 05:49:50,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-04 05:49:50,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:50,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-04 05:49:50,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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-04 05:49:50,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-04 05:49:50,270 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-04 05:49:50,270 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 77 flow. Second operand 3 states and 381 transitions. [2023-08-04 05:49:50,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 163 flow [2023-08-04 05:49:50,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 159 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:49:50,271 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 81 flow [2023-08-04 05:49:50,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-04 05:49:50,272 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-04 05:49:50,272 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 81 flow [2023-08-04 05:49:50,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-04 05:49:50,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:50,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:50,281 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-04 05:49:50,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:50,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:49:50,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:50,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1281950252, now seen corresponding path program 1 times [2023-08-04 05:49:50,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:50,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884206363] [2023-08-04 05:49:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:49:50,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:50,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884206363] [2023-08-04 05:49:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884206363] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:49:50,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146426863] [2023-08-04 05:49:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:50,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:50,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:49:50,545 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-04 05:49:50,548 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-04 05:49:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:50,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:49:50,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:49:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:49:50,668 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:49:50,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146426863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:50,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:49:50,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:49:50,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215569450] [2023-08-04 05:49:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:50,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:49:50,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 249 [2023-08-04 05:49:50,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-04 05:49:50,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:50,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 249 [2023-08-04 05:49:50,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:50,993 INFO L124 PetriNetUnfolderBase]: 1721/2576 cut-off events. [2023-08-04 05:49:50,994 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-08-04 05:49:50,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5259 conditions, 2576 events. 1721/2576 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12788 event pairs, 1024 based on Foata normal form. 0/2470 useless extension candidates. Maximal degree in co-relation 5243. Up to 2192 conditions per place. [2023-08-04 05:49:51,008 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 36 selfloop transitions, 2 changer transitions 1/42 dead transitions. [2023-08-04 05:49:51,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 183 flow [2023-08-04 05:49:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:49:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:49:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-08-04 05:49:51,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153949129852744 [2023-08-04 05:49:51,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-08-04 05:49:51,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-08-04 05:49:51,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:51,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-08-04 05:49:51,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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-04 05:49:51,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-04 05:49:51,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-04 05:49:51,014 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 81 flow. Second operand 3 states and 385 transitions. [2023-08-04 05:49:51,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 183 flow [2023-08-04 05:49:51,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 179 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:49:51,018 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 85 flow [2023-08-04 05:49:51,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-04 05:49:51,020 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-08-04 05:49:51,020 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 85 flow [2023-08-04 05:49:51,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-04 05:49:51,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:51,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:51,029 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-04 05:49:51,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 05:49:51,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:49:51,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 234225335, now seen corresponding path program 1 times [2023-08-04 05:49:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761043855] [2023-08-04 05:49:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:49:51,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:51,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761043855] [2023-08-04 05:49:51,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761043855] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:49:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241873076] [2023-08-04 05:49:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:51,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:51,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:49:51,313 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-04 05:49:51,336 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-04 05:49:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:51,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:49:51,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:49:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:49:51,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:49:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:49:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241873076] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:49:51,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:49:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:49:51,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393540006] [2023-08-04 05:49:51,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:49:51,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:49:51,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:51,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:49:51,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:49:51,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 249 [2023-08-04 05:49:51,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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-04 05:49:51,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:51,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 249 [2023-08-04 05:49:51,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:51,506 INFO L124 PetriNetUnfolderBase]: 8/26 cut-off events. [2023-08-04 05:49:51,506 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 05:49:51,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 26 events. 8/26 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 2 based on Foata normal form. 5/31 useless extension candidates. Maximal degree in co-relation 58. Up to 18 conditions per place. [2023-08-04 05:49:51,506 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2023-08-04 05:49:51,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 14 transitions, 59 flow [2023-08-04 05:49:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:49:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:49:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-08-04 05:49:51,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4718875502008032 [2023-08-04 05:49:51,509 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-08-04 05:49:51,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-08-04 05:49:51,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:51,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-08-04 05:49:51,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 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-04 05:49:51,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-04 05:49:51,513 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-04 05:49:51,513 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 85 flow. Second operand 4 states and 470 transitions. [2023-08-04 05:49:51,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 14 transitions, 59 flow [2023-08-04 05:49:51,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 14 transitions, 57 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:49:51,514 INFO L231 Difference]: Finished difference. Result has 20 places, 0 transitions, 0 flow [2023-08-04 05:49:51,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=20, PETRI_TRANSITIONS=0} [2023-08-04 05:49:51,515 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -23 predicate places. [2023-08-04 05:49:51,515 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 0 transitions, 0 flow [2023-08-04 05:49:51,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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-04 05:49:51,518 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:49:51,518 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:49:51,518 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:49:51,527 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-04 05:49:51,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:51,725 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 05:49:51,727 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:49:51,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 135 transitions, 285 flow [2023-08-04 05:49:51,771 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-04 05:49:51,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:51,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 30/457 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2016 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-04 05:49:51,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 135 transitions, 285 flow [2023-08-04 05:49:51,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 106 transitions, 227 flow [2023-08-04 05:49:51,774 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:49:51,774 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 106 transitions, 227 flow [2023-08-04 05:49:51,774 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 106 transitions, 227 flow [2023-08-04 05:49:51,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 106 transitions, 227 flow [2023-08-04 05:49:51,791 INFO L124 PetriNetUnfolderBase]: 6/225 cut-off events. [2023-08-04 05:49:51,791 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:51,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 225 events. 6/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 680 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. [2023-08-04 05:49:51,793 INFO L119 LiptonReduction]: Number of co-enabled transitions 1722 [2023-08-04 05:49:54,715 INFO L134 LiptonReduction]: Checked pairs total: 3757 [2023-08-04 05:49:54,715 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-04 05:49:54,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:49:54,717 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;@315019bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:49:54,718 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:49:54,720 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:49:54,720 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2023-08-04 05:49:54,720 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:54,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:54,721 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:49:54,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:49:54,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1801256815, now seen corresponding path program 1 times [2023-08-04 05:49:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:54,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185813307] [2023-08-04 05:49:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:49:54,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:49:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:49:54,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:49:54,782 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:49:54,782 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:49:54,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:49:54,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:49:54,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:49:54,783 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 05:49:54,783 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:49:54,784 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:49:54,784 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:49:54,808 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:49:54,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 362 flow [2023-08-04 05:49:54,929 INFO L124 PetriNetUnfolderBase]: 93/1402 cut-off events. [2023-08-04 05:49:54,930 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:49:54,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 1402 events. 93/1402 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9717 event pairs, 0 based on Foata normal form. 0/1241 useless extension candidates. Maximal degree in co-relation 1016. Up to 54 conditions per place. [2023-08-04 05:49:54,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 163 transitions, 362 flow [2023-08-04 05:49:54,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 163 transitions, 362 flow [2023-08-04 05:49:54,940 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:49:54,940 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 163 transitions, 362 flow [2023-08-04 05:49:54,941 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 163 transitions, 362 flow [2023-08-04 05:49:54,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 362 flow [2023-08-04 05:49:55,082 INFO L124 PetriNetUnfolderBase]: 93/1402 cut-off events. [2023-08-04 05:49:55,082 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:49:55,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 1402 events. 93/1402 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9717 event pairs, 0 based on Foata normal form. 0/1241 useless extension candidates. Maximal degree in co-relation 1016. Up to 54 conditions per place. [2023-08-04 05:49:55,115 INFO L119 LiptonReduction]: Number of co-enabled transitions 7752 [2023-08-04 05:49:58,344 INFO L134 LiptonReduction]: Checked pairs total: 29591 [2023-08-04 05:49:58,344 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-04 05:49:58,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:49:58,346 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;@315019bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:49:58,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:49:58,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:49:58,348 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2023-08-04 05:49:58,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:58,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:58,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:49:58,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:49:58,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash 30033713, now seen corresponding path program 1 times [2023-08-04 05:49:58,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:58,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177819076] [2023-08-04 05:49:58,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:58,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:58,449 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-04 05:49:58,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:58,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177819076] [2023-08-04 05:49:58,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177819076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:58,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:49:58,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:49:58,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334368564] [2023-08-04 05:49:58,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:58,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:58,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:58,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:49:58,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 283 [2023-08-04 05:49:58,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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-04 05:49:58,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:58,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 283 [2023-08-04 05:49:58,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:51:18,128 INFO L124 PetriNetUnfolderBase]: 633758/884905 cut-off events. [2023-08-04 05:51:18,128 INFO L125 PetriNetUnfolderBase]: For 9470/9470 co-relation queries the response was YES. [2023-08-04 05:51:21,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688264 conditions, 884905 events. 633758/884905 cut-off events. For 9470/9470 co-relation queries the response was YES. Maximal size of possible extension queue 22754. Compared 7743525 event pairs, 105182 based on Foata normal form. 17577/787992 useless extension candidates. Maximal degree in co-relation 1418120. Up to 729279 conditions per place. [2023-08-04 05:51:24,510 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 75 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2023-08-04 05:51:24,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 401 flow [2023-08-04 05:51:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:51:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:51:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-08-04 05:51:24,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806831566548881 [2023-08-04 05:51:24,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-08-04 05:51:24,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-08-04 05:51:24,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:51:24,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-08-04 05:51:24,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-04 05:51:24,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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-04 05:51:24,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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-04 05:51:24,522 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 156 flow. Second operand 3 states and 493 transitions. [2023-08-04 05:51:24,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 401 flow [2023-08-04 05:51:24,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 395 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 05:51:24,536 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 169 flow [2023-08-04 05:51:24,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2023-08-04 05:51:24,537 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2023-08-04 05:51:24,537 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 169 flow [2023-08-04 05:51:24,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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-04 05:51:24,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:51:24,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:51:24,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:51:24,538 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:51:24,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:51:24,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1900617181, now seen corresponding path program 1 times [2023-08-04 05:51:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:51:24,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016417496] [2023-08-04 05:51:24,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:51:24,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:51:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:51:24,565 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-04 05:51:24,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:51:24,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016417496] [2023-08-04 05:51:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016417496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:51:24,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:51:24,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:51:24,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507327140] [2023-08-04 05:51:24,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:51:24,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:51:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:51:24,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:51:24,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:51:24,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 283 [2023-08-04 05:51:24,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-04 05:51:24,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:51:24,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 283 [2023-08-04 05:51:24,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:52:44,537 INFO L124 PetriNetUnfolderBase]: 618374/799268 cut-off events. [2023-08-04 05:52:44,537 INFO L125 PetriNetUnfolderBase]: For 61906/61906 co-relation queries the response was YES. [2023-08-04 05:52:47,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687815 conditions, 799268 events. 618374/799268 cut-off events. For 61906/61906 co-relation queries the response was YES. Maximal size of possible extension queue 24669. Compared 5895567 event pairs, 588858 based on Foata normal form. 0/702174 useless extension candidates. Maximal degree in co-relation 1111246. Up to 771849 conditions per place. [2023-08-04 05:52:50,361 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-04 05:52:50,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 282 flow [2023-08-04 05:52:50,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:52:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:52:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-08-04 05:52:50,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5312131919905771 [2023-08-04 05:52:50,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-08-04 05:52:50,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-08-04 05:52:50,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:52:50,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-08-04 05:52:50,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:52:50,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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-04 05:52:50,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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-04 05:52:50,366 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 169 flow. Second operand 3 states and 451 transitions. [2023-08-04 05:52:50,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 282 flow [2023-08-04 05:52:50,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 66 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:52:50,368 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 178 flow [2023-08-04 05:52:50,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2023-08-04 05:52:50,369 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2023-08-04 05:52:50,369 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 178 flow [2023-08-04 05:52:50,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-04 05:52:50,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:52:50,370 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:52:50,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:52:50,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:52:50,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:52:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash -965840728, now seen corresponding path program 1 times [2023-08-04 05:52:50,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:52:50,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915259399] [2023-08-04 05:52:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:52:50,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:52:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:52:50,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:52:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:52:50,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:52:50,399 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:52:50,400 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:52:50,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:52:50,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:52:50,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:52:50,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:52:50,400 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:52:50,401 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:52:50,402 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:52:50,402 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:52:50,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:52:50 BasicIcfg [2023-08-04 05:52:50,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:52:50,480 INFO L158 Benchmark]: Toolchain (without parser) took 187737.86ms. Allocated memory was 352.3MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 310.1MB in the beginning and 9.6GB in the end (delta: -9.3GB). Peak memory consumption was 6.4GB. Max. memory is 16.0GB. [2023-08-04 05:52:50,480 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 352.3MB. Free memory is still 300.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:52:50,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.89ms. Allocated memory is still 352.3MB. Free memory was 310.1MB in the beginning and 286.2MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:52:50,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.66ms. Allocated memory is still 352.3MB. Free memory was 286.2MB in the beginning and 283.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:52:50,481 INFO L158 Benchmark]: Boogie Preprocessor took 41.72ms. Allocated memory is still 352.3MB. Free memory was 283.6MB in the beginning and 281.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:52:50,481 INFO L158 Benchmark]: RCFGBuilder took 581.54ms. Allocated memory was 352.3MB in the beginning and 564.1MB in the end (delta: 211.8MB). Free memory was 281.6MB in the beginning and 527.3MB in the end (delta: -245.8MB). Peak memory consumption was 49.5MB. Max. memory is 16.0GB. [2023-08-04 05:52:50,482 INFO L158 Benchmark]: TraceAbstraction took 186440.65ms. Allocated memory was 564.1MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 526.3MB in the beginning and 9.6GB in the end (delta: -9.1GB). Peak memory consumption was 6.4GB. Max. memory is 16.0GB. [2023-08-04 05:52:50,483 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 352.3MB. Free memory is still 300.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 589.89ms. Allocated memory is still 352.3MB. Free memory was 310.1MB in the beginning and 286.2MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.66ms. Allocated memory is still 352.3MB. Free memory was 286.2MB in the beginning and 283.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.72ms. Allocated memory is still 352.3MB. Free memory was 283.6MB in the beginning and 281.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 581.54ms. Allocated memory was 352.3MB in the beginning and 564.1MB in the end (delta: 211.8MB). Free memory was 281.6MB in the beginning and 527.3MB in the end (delta: -245.8MB). Peak memory consumption was 49.5MB. Max. memory is 16.0GB. * TraceAbstraction took 186440.65ms. Allocated memory was 564.1MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 526.3MB in the beginning and 9.6GB in the end (delta: -9.1GB). Peak memory consumption was 6.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 137 PlacesBefore, 43 PlacesAfterwards, 135 TransitionsBefore, 37 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 114 TotalNumberOfCompositions, 8937 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4701, independent: 4481, independent conditional: 0, independent unconditional: 4481, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1677, independent: 1648, independent conditional: 0, independent unconditional: 1648, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4701, independent: 2833, independent conditional: 0, independent unconditional: 2833, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 1677, unknown conditional: 0, unknown unconditional: 1677] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 111 PlacesBefore, 35 PlacesAfterwards, 106 TransitionsBefore, 28 TransitionsAfterwards, 1722 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 84 TotalNumberOfCompositions, 3757 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1806, independent: 1675, independent conditional: 0, independent unconditional: 1675, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 869, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1806, independent: 826, independent conditional: 0, independent unconditional: 826, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 869, unknown conditional: 0, unknown unconditional: 869] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 171 PlacesBefore, 72 PlacesAfterwards, 163 TransitionsBefore, 60 TransitionsAfterwards, 7752 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 120 TotalNumberOfCompositions, 29591 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8740, independent: 8309, independent conditional: 0, independent unconditional: 8309, dependent: 431, dependent conditional: 0, dependent unconditional: 431, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3523, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8740, independent: 4842, independent conditional: 0, independent unconditional: 4842, dependent: 375, dependent conditional: 0, dependent unconditional: 375, unknown: 3523, unknown conditional: 0, unknown unconditional: 3523] , Statistics on independence cache: Total cache size (in pairs): 397, Positive cache size: 367, Positive conditional cache size: 0, Positive unconditional cache size: 367, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633[2]; [L849] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t633={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] COND TRUE 0 asdf<2 [L849] FCALL, FORK 0 pthread_create(&t633[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t633[asdf], ((void *)0), P0, ((void *)0))=-2, t633={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t633={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] COND TRUE 0 asdf<2 [L849] FCALL, FORK 0 pthread_create(&t633[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t633[asdf], ((void *)0), P0, ((void *)0))=-1, t633={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 2 a$w_buff1 = a$w_buff0 [L750] 2 a$w_buff0 = 1 [L751] 2 a$w_buff1_used = a$w_buff0_used [L752] 2 a$w_buff0_used = (_Bool)1 [L753] CALL 2 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=1, a$w_buff1_used=1, a=0, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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 with 1 thread instances CFG has 7 procedures, 159 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: 7.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 5 mSDtfsCounter, 280 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=89occurred in iteration=0, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 10/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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 187 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 175.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 171.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 159 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: 3.1s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 05:52:50,513 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...