/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_mix001.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:25:55,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:25:55,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:25:55,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:25:55,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:25:55,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:25:55,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:25:55,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:25:55,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:25:55,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:25:55,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:25:55,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:25:55,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:25:55,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:25:55,723 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:25:55,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:25:55,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:25:55,724 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:25:55,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:25:55,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:25:55,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:25:55,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:25:55,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:25:55,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:25:55,726 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:25:55,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:25:55,727 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:25:55,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:25:55,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:25:55,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:25:55,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:25:55,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:25:55,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:25:55,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:25:55,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:25:55,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:25:55,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:25:55,731 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:25:55,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:25:55,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:25:55,732 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:25:55,732 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:25:55,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:25:55,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:25:55,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:25:55,970 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:25:55,971 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:25:55,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix001.opt_bound2.i [2023-08-04 05:25:57,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:25:57,371 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:25:57,371 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix001.opt_bound2.i [2023-08-04 05:25:57,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ebab019/110634e87ed34c37a98d31335ca5196e/FLAGcfe900f58 [2023-08-04 05:25:57,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ebab019/110634e87ed34c37a98d31335ca5196e [2023-08-04 05:25:57,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:25:57,416 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:25:57,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:25:57,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:25:57,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:25:57,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:57,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6431dd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57, skipping insertion in model container [2023-08-04 05:25:57,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:57,471 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:25:57,608 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_mix001.opt_bound2.i[944,957] [2023-08-04 05:25:57,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:25:57,818 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:25:57,830 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_mix001.opt_bound2.i[944,957] [2023-08-04 05:25:57,855 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:25:57,856 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:25:57,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:25:57,906 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:25:57,906 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:25:57,911 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:25:57,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57 WrapperNode [2023-08-04 05:25:57,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:25:57,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:25:57,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:25:57,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:25:57,919 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:25:57" (1/1) ... [2023-08-04 05:25:57,934 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:25:57" (1/1) ... [2023-08-04 05:25:57,962 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2023-08-04 05:25:57,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:25:57,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:25:57,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:25:57,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:25:57,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:57,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:57,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:57,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:57,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:58,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:58,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:58,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:58,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:25:58,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:25:58,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:25:58,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:25:58,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57" (1/1) ... [2023-08-04 05:25:58,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:25:58,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:25:58,066 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:25:58,068 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:25:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:25:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:25:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:25:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:25:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:25:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:25:58,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:25:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:25:58,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:25:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:25:58,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:25:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:25:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:25:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:25:58,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:25:58,097 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:25:58,219 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:25:58,221 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:25:58,552 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:25:58,699 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:25:58,700 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:25:58,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:25:58 BoogieIcfgContainer [2023-08-04 05:25:58,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:25:58,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:25:58,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:25:58,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:25:58,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:25:57" (1/3) ... [2023-08-04 05:25:58,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37824153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:25:58, skipping insertion in model container [2023-08-04 05:25:58,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:57" (2/3) ... [2023-08-04 05:25:58,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37824153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:25:58, skipping insertion in model container [2023-08-04 05:25:58,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:25:58" (3/3) ... [2023-08-04 05:25:58,716 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix001.opt_bound2.i [2023-08-04 05:25:58,722 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:25:58,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:25:58,729 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:25:58,729 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:25:58,779 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:25:58,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:25:58,973 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-04 05:25:58,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:58,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2012 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-08-04 05:25:58,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:25:58,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 132 transitions, 275 flow [2023-08-04 05:25:58,990 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:25:59,005 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 132 transitions, 275 flow [2023-08-04 05:25:59,008 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 132 transitions, 275 flow [2023-08-04 05:25:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 275 flow [2023-08-04 05:25:59,065 INFO L124 PetriNetUnfolderBase]: 30/456 cut-off events. [2023-08-04 05:25:59,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:59,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 456 events. 30/456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1984 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 266. Up to 16 conditions per place. [2023-08-04 05:25:59,074 INFO L119 LiptonReduction]: Number of co-enabled transitions 2732 [2023-08-04 05:26:02,473 INFO L134 LiptonReduction]: Checked pairs total: 6868 [2023-08-04 05:26:02,474 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-04 05:26:02,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:26:02,500 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;@369119dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:26:02,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:26:02,506 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:26:02,506 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2023-08-04 05:26:02,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:26:02,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:26:02,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:26:02,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:26:02,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:26:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash 338332368, now seen corresponding path program 1 times [2023-08-04 05:26:02,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:26:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225203575] [2023-08-04 05:26:02,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:26:02,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:26:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:26:02,820 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:26:02,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:26:02,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225203575] [2023-08-04 05:26:02,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225203575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:26:02,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:26:02,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:26:02,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424384962] [2023-08-04 05:26:02,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:26:02,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:26:02,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:26:02,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:26:02,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:26:02,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246 [2023-08-04 05:26:02,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:26:02,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:26:02,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246 [2023-08-04 05:26:02,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:26:03,294 INFO L124 PetriNetUnfolderBase]: 1828/2936 cut-off events. [2023-08-04 05:26:03,294 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 05:26:03,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5826 conditions, 2936 events. 1828/2936 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 17648 event pairs, 1501 based on Foata normal form. 105/2544 useless extension candidates. Maximal degree in co-relation 5813. Up to 2807 conditions per place. [2023-08-04 05:26:03,312 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 28 selfloop transitions, 2 changer transitions 1/36 dead transitions. [2023-08-04 05:26:03,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 145 flow [2023-08-04 05:26:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:26:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:26:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-04 05:26:03,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2023-08-04 05:26:03,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-04 05:26:03,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-04 05:26:03,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:26:03,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-04 05:26:03,337 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:26:03,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:26:03,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:26:03,344 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 79 flow. Second operand 3 states and 378 transitions. [2023-08-04 05:26:03,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 145 flow [2023-08-04 05:26:03,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 145 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:26:03,348 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 85 flow [2023-08-04 05:26:03,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-04 05:26:03,352 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-04 05:26:03,353 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 85 flow [2023-08-04 05:26:03,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:26:03,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:26:03,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:26:03,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:26:03,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:26:03,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:26:03,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1720555013, now seen corresponding path program 1 times [2023-08-04 05:26:03,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:26:03,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659030666] [2023-08-04 05:26:03,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:26:03,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:26:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:26:03,418 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:26:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:26:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659030666] [2023-08-04 05:26:03,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659030666] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:26:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619609590] [2023-08-04 05:26:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:26:03,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:26:03,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:26:03,437 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:26:03,473 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:26:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:26:03,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:26:03,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:26:03,603 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:26:03,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:26:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619609590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:26:03,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:26:03,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:26:03,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195213282] [2023-08-04 05:26:03,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:26:03,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:26:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:26:03,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:26:03,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:26:03,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246 [2023-08-04 05:26:03,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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:26:03,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:26:03,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246 [2023-08-04 05:26:03,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:26:03,955 INFO L124 PetriNetUnfolderBase]: 1584/2506 cut-off events. [2023-08-04 05:26:03,955 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 05:26:03,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4972 conditions, 2506 events. 1584/2506 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 14323 event pairs, 1374 based on Foata normal form. 0/2108 useless extension candidates. Maximal degree in co-relation 4956. Up to 2352 conditions per place. [2023-08-04 05:26:03,973 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 31 selfloop transitions, 2 changer transitions 1/39 dead transitions. [2023-08-04 05:26:03,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 165 flow [2023-08-04 05:26:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:26:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:26:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-08-04 05:26:03,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5149051490514905 [2023-08-04 05:26:03,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-08-04 05:26:03,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-08-04 05:26:03,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:26:03,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-08-04 05:26:03,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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:26:03,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:26:03,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:26:03,990 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 85 flow. Second operand 3 states and 380 transitions. [2023-08-04 05:26:03,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 165 flow [2023-08-04 05:26:03,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:26:03,992 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 89 flow [2023-08-04 05:26:03,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-04 05:26:03,993 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-04 05:26:03,993 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 89 flow [2023-08-04 05:26:03,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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:26:03,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:26:03,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:26:04,003 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:26:04,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:26:04,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:26:04,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:26:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1082185487, now seen corresponding path program 1 times [2023-08-04 05:26:04,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:26:04,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991904628] [2023-08-04 05:26:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:26:04,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:26:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:26:04,272 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:26:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:26:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991904628] [2023-08-04 05:26:04,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991904628] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:26:04,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189154573] [2023-08-04 05:26:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:26:04,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:26:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:26:04,275 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:26:04,300 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:26:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:26:04,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:26:04,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:26:04,401 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:26:04,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:26:04,418 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:26:04,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189154573] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:26:04,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:26:04,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:26:04,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838230272] [2023-08-04 05:26:04,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:26:04,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:26:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:26:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:26:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:26:04,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-08-04 05:26:04,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 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:26:04,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:26:04,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-08-04 05:26:04,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:26:04,459 INFO L124 PetriNetUnfolderBase]: 4/17 cut-off events. [2023-08-04 05:26:04,460 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 05:26:04,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 17 events. 4/17 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 3/19 useless extension candidates. Maximal degree in co-relation 37. Up to 10 conditions per place. [2023-08-04 05:26:04,460 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2023-08-04 05:26:04,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 11 transitions, 45 flow [2023-08-04 05:26:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:26:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:26:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-04 05:26:04,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735772357723577 [2023-08-04 05:26:04,462 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-04 05:26:04,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-04 05:26:04,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:26:04,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-04 05:26:04,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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:26:04,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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:26:04,467 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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:26:04,467 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 89 flow. Second operand 4 states and 466 transitions. [2023-08-04 05:26:04,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 11 transitions, 45 flow [2023-08-04 05:26:04,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 11 transitions, 43 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:26:04,467 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 05:26:04,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-04 05:26:04,469 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -22 predicate places. [2023-08-04 05:26:04,469 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 05:26:04,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 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:26:04,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:26:04,472 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:26:04,472 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:26:04,483 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:26:04,677 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,SelfDestructingSolverStorable2 [2023-08-04 05:26:04,678 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:26:04,680 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:26:04,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:26:04,718 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-04 05:26:04,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:26:04,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2012 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-08-04 05:26:04,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:26:04,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 105 transitions, 225 flow [2023-08-04 05:26:04,720 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:26:04,720 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 225 flow [2023-08-04 05:26:04,721 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 225 flow [2023-08-04 05:26:04,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 225 flow [2023-08-04 05:26:04,736 INFO L124 PetriNetUnfolderBase]: 6/227 cut-off events. [2023-08-04 05:26:04,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:26:04,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 227 events. 6/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 662 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 156. Up to 8 conditions per place. [2023-08-04 05:26:04,738 INFO L119 LiptonReduction]: Number of co-enabled transitions 1440 [2023-08-04 05:26:07,545 INFO L134 LiptonReduction]: Checked pairs total: 2751 [2023-08-04 05:26:07,546 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-08-04 05:26:07,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:26:07,549 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;@369119dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:26:07,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:26:07,551 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:26:07,551 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2023-08-04 05:26:07,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:26:07,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:26:07,552 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:26:07,552 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:26:07,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:26:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1443508713, now seen corresponding path program 1 times [2023-08-04 05:26:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:26:07,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640518121] [2023-08-04 05:26:07,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:26:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:26:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:26:07,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:26:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:26:07,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:26:07,617 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:26:07,617 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:26:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:26:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:26:07,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 05:26:07,618 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 05:26:07,619 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:26:07,619 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:26:07,619 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:26:07,651 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:26:07,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 356 flow [2023-08-04 05:26:07,798 INFO L124 PetriNetUnfolderBase]: 93/1415 cut-off events. [2023-08-04 05:26:07,798 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:26:07,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 1415 events. 93/1415 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9841 event pairs, 0 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 1020. Up to 54 conditions per place. [2023-08-04 05:26:07,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 160 transitions, 356 flow [2023-08-04 05:26:07,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 158 transitions, 344 flow [2023-08-04 05:26:07,809 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:26:07,809 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 158 transitions, 344 flow [2023-08-04 05:26:07,809 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 158 transitions, 344 flow [2023-08-04 05:26:07,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 158 transitions, 344 flow [2023-08-04 05:26:07,941 INFO L124 PetriNetUnfolderBase]: 93/1411 cut-off events. [2023-08-04 05:26:07,941 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-04 05:26:07,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 1411 events. 93/1411 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9775 event pairs, 0 based on Foata normal form. 0/1234 useless extension candidates. Maximal degree in co-relation 1011. Up to 54 conditions per place. [2023-08-04 05:26:07,977 INFO L119 LiptonReduction]: Number of co-enabled transitions 6652 [2023-08-04 05:26:11,200 INFO L134 LiptonReduction]: Checked pairs total: 20336 [2023-08-04 05:26:11,200 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-04 05:26:11,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:26:11,203 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;@369119dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:26:11,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:26:11,205 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:26:11,206 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-08-04 05:26:11,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:26:11,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:26:11,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:26:11,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:26:11,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:26:11,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1006229350, now seen corresponding path program 1 times [2023-08-04 05:26:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:26:11,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370452837] [2023-08-04 05:26:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:26:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:26:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:26:11,236 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:26:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:26:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370452837] [2023-08-04 05:26:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370452837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:26:11,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:26:11,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:26:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286490732] [2023-08-04 05:26:11,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:26:11,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:26:11,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:26:11,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:26:11,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:26:11,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-04 05:26:11,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:26:11,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:26:11,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-04 05:26:11,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:26:55,582 INFO L124 PetriNetUnfolderBase]: 378842/493708 cut-off events. [2023-08-04 05:26:55,582 INFO L125 PetriNetUnfolderBase]: For 5733/5733 co-relation queries the response was YES. [2023-08-04 05:26:56,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977871 conditions, 493708 events. 378842/493708 cut-off events. For 5733/5733 co-relation queries the response was YES. Maximal size of possible extension queue 16035. Compared 3594305 event pairs, 346158 based on Foata normal form. 10836/438976 useless extension candidates. Maximal degree in co-relation 282373. Up to 476892 conditions per place. [2023-08-04 05:26:58,779 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 43 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 05:26:58,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 232 flow [2023-08-04 05:26:58,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:26:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:26:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-04 05:26:58,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5328554360812425 [2023-08-04 05:26:58,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-04 05:26:58,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-04 05:26:58,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:26:58,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-04 05:26:58,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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:26:58,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:26:58,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:26:58,785 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 136 flow. Second operand 3 states and 446 transitions. [2023-08-04 05:26:58,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 232 flow [2023-08-04 05:26:58,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 57 transitions, 230 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 05:26:58,795 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 144 flow [2023-08-04 05:26:58,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2023-08-04 05:26:58,796 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2023-08-04 05:26:58,796 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 144 flow [2023-08-04 05:26:58,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:26:58,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:26:58,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:26:58,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:26:58,797 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:26:58,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:26:58,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1930718755, now seen corresponding path program 1 times [2023-08-04 05:26:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:26:58,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919935221] [2023-08-04 05:26:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:26:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:26:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:26:58,833 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:26:58,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:26:58,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919935221] [2023-08-04 05:26:58,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919935221] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:26:58,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417720928] [2023-08-04 05:26:58,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:26:58,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:26:58,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:26:58,841 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:26:58,844 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:26:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:26:58,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:26:58,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:26:58,929 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:26:58,929 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:26:58,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417720928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:26:58,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:26:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:26:58,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059296665] [2023-08-04 05:26:58,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:26:58,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:26:58,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:26:58,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:26:58,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:26:58,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-04 05:26:58,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:26:58,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:26:58,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-04 05:26:58,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:27:38,300 INFO L124 PetriNetUnfolderBase]: 366838/477616 cut-off events. [2023-08-04 05:27:38,300 INFO L125 PetriNetUnfolderBase]: For 4155/4155 co-relation queries the response was YES. [2023-08-04 05:27:39,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944093 conditions, 477616 events. 366838/477616 cut-off events. For 4155/4155 co-relation queries the response was YES. Maximal size of possible extension queue 15879. Compared 3441807 event pairs, 296770 based on Foata normal form. 0/417096 useless extension candidates. Maximal degree in co-relation 944055. Up to 460105 conditions per place. [2023-08-04 05:27:41,650 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-04 05:27:41,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 264 flow [2023-08-04 05:27:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:27:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:27:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-04 05:27:41,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505 [2023-08-04 05:27:41,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-04 05:27:41,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-04 05:27:41,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:27:41,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-04 05:27:41,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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:27:41,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:27:41,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:27:41,658 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 144 flow. Second operand 3 states and 450 transitions. [2023-08-04 05:27:41,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 264 flow [2023-08-04 05:27:41,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 63 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:27:41,660 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 154 flow [2023-08-04 05:27:41,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-04 05:27:41,661 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2023-08-04 05:27:41,661 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 154 flow [2023-08-04 05:27:41,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:27:41,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:27:41,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:27:41,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-04 05:27:41,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:27:41,867 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:27:41,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:27:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1718402341, now seen corresponding path program 1 times [2023-08-04 05:27:41,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:27:41,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120409342] [2023-08-04 05:27:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:27:41,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:27:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:27:41,922 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:27:41,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:27:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120409342] [2023-08-04 05:27:41,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120409342] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:27:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754837657] [2023-08-04 05:27:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:27:41,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:27:41,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:27:41,924 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:27:41,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 05:27:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:27:42,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:27:42,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:27:42,031 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:27:42,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:27:42,051 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:27:42,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754837657] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:27:42,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:27:42,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:27:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586065036] [2023-08-04 05:27:42,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:27:42,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:27:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:27:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:27:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:27:42,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 279 [2023-08-04 05:27:42,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 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:27:42,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:27:42,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 279 [2023-08-04 05:27:42,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:28:12,891 INFO L124 PetriNetUnfolderBase]: 286810/369891 cut-off events. [2023-08-04 05:28:12,892 INFO L125 PetriNetUnfolderBase]: For 3521/3521 co-relation queries the response was YES. [2023-08-04 05:28:14,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731852 conditions, 369891 events. 286810/369891 cut-off events. For 3521/3521 co-relation queries the response was YES. Maximal size of possible extension queue 12882. Compared 2569943 event pairs, 216748 based on Foata normal form. 3/324705 useless extension candidates. Maximal degree in co-relation 259501. Up to 356836 conditions per place. [2023-08-04 05:28:15,487 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 47 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2023-08-04 05:28:15,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 63 transitions, 272 flow [2023-08-04 05:28:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:28:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:28:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-08-04 05:28:15,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188172043010753 [2023-08-04 05:28:15,489 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-08-04 05:28:15,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-08-04 05:28:15,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:28:15,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-08-04 05:28:15,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 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:28:15,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 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:28:15,493 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 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:28:15,493 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 154 flow. Second operand 4 states and 579 transitions. [2023-08-04 05:28:15,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 63 transitions, 272 flow [2023-08-04 05:28:15,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 63 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:28:15,496 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 166 flow [2023-08-04 05:28:15,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-08-04 05:28:15,497 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2023-08-04 05:28:15,497 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 166 flow [2023-08-04 05:28:15,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 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:28:15,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:28:15,497 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:28:15,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 05:28:15,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:28:15,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:28:15,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:28:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1801822595, now seen corresponding path program 1 times [2023-08-04 05:28:15,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:28:15,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103417373] [2023-08-04 05:28:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:28:15,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:28:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:28:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:28:15,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:28:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103417373] [2023-08-04 05:28:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103417373] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:28:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191792451] [2023-08-04 05:28:15,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:28:15,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:28:15,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:28:15,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:28:15,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 05:28:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:28:15,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:28:15,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:28:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:28:15,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:28:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:28:15,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191792451] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:28:15,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:28:15,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 05:28:15,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635507766] [2023-08-04 05:28:15,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:28:15,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:28:15,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:28:15,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:28:15,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:28:15,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 279 [2023-08-04 05:28:15,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 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:28:15,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:28:15,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 279 [2023-08-04 05:28:15,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:28:40,838 INFO L124 PetriNetUnfolderBase]: 238048/304735 cut-off events. [2023-08-04 05:28:40,838 INFO L125 PetriNetUnfolderBase]: For 2637/2637 co-relation queries the response was YES. [2023-08-04 05:28:41,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603094 conditions, 304735 events. 238048/304735 cut-off events. For 2637/2637 co-relation queries the response was YES. Maximal size of possible extension queue 11545. Compared 2021961 event pairs, 153634 based on Foata normal form. 36/268761 useless extension candidates. Maximal degree in co-relation 213487. Up to 292876 conditions per place. [2023-08-04 05:28:42,991 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 58 selfloop transitions, 3 changer transitions 1/74 dead transitions. [2023-08-04 05:28:42,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 328 flow [2023-08-04 05:28:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:28:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:28:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2023-08-04 05:28:42,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286738351254481 [2023-08-04 05:28:42,993 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2023-08-04 05:28:42,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2023-08-04 05:28:42,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:28:42,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2023-08-04 05:28:42,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.5) internal successors, (590), 4 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:28:42,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 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:28:42,997 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 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:28:42,997 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 166 flow. Second operand 4 states and 590 transitions. [2023-08-04 05:28:42,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 328 flow [2023-08-04 05:28:42,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 74 transitions, 321 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:28:42,999 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 173 flow [2023-08-04 05:28:43,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2023-08-04 05:28:43,000 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2023-08-04 05:28:43,000 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 173 flow [2023-08-04 05:28:43,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 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:28:43,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:28:43,001 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:28:43,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 05:28:43,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:28:43,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:28:43,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:28:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1833895236, now seen corresponding path program 1 times [2023-08-04 05:28:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:28:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950111782] [2023-08-04 05:28:43,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:28:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:28:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:28:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 05:28:43,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:28:43,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950111782] [2023-08-04 05:28:43,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950111782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:28:43,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:28:43,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:28:43,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902684012] [2023-08-04 05:28:43,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:28:43,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:28:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:28:43,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:28:43,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:28:43,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 279 [2023-08-04 05:28:43,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 55 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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:28:43,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:28:43,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 279 [2023-08-04 05:28:43,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:05,251 INFO L124 PetriNetUnfolderBase]: 214312/276112 cut-off events. [2023-08-04 05:29:05,251 INFO L125 PetriNetUnfolderBase]: For 3565/3565 co-relation queries the response was YES. [2023-08-04 05:29:06,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544911 conditions, 276112 events. 214312/276112 cut-off events. For 3565/3565 co-relation queries the response was YES. Maximal size of possible extension queue 10773. Compared 1866484 event pairs, 34888 based on Foata normal form. 0/248883 useless extension candidates. Maximal degree in co-relation 192909. Up to 249409 conditions per place. [2023-08-04 05:29:07,228 INFO L140 encePairwiseOnDemand]: 274/279 looper letters, 61 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2023-08-04 05:29:07,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 348 flow [2023-08-04 05:29:07,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:29:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:29:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-04 05:29:07,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5639187574671446 [2023-08-04 05:29:07,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-04 05:29:07,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-04 05:29:07,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:07,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-04 05:29:07,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:07,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:29:07,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:29:07,233 INFO L175 Difference]: Start difference. First operand has 77 places, 55 transitions, 173 flow. Second operand 3 states and 472 transitions. [2023-08-04 05:29:07,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 348 flow [2023-08-04 05:29:07,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 341 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:29:07,236 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 187 flow [2023-08-04 05:29:07,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2023-08-04 05:29:07,237 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2023-08-04 05:29:07,237 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 187 flow [2023-08-04 05:29:07,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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:29:07,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:07,237 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:29:07,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:29:07,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:29:07,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:07,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1015539452, now seen corresponding path program 1 times [2023-08-04 05:29:07,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:07,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213121731] [2023-08-04 05:29:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:07,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 05:29:07,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:07,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213121731] [2023-08-04 05:29:07,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213121731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:07,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:29:07,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 05:29:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865097554] [2023-08-04 05:29:07,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:07,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:07,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:07,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:29:07,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-04 05:29:07,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:07,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:07,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-04 05:29:07,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:31,815 INFO L124 PetriNetUnfolderBase]: 211864/270208 cut-off events. [2023-08-04 05:29:31,816 INFO L125 PetriNetUnfolderBase]: For 14128/14128 co-relation queries the response was YES. [2023-08-04 05:29:32,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564487 conditions, 270208 events. 211864/270208 cut-off events. For 14128/14128 co-relation queries the response was YES. Maximal size of possible extension queue 10580. Compared 1780260 event pairs, 174592 based on Foata normal form. 0/241971 useless extension candidates. Maximal degree in co-relation 199242. Up to 257980 conditions per place. [2023-08-04 05:29:33,890 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 59 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-08-04 05:29:33,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 73 transitions, 344 flow [2023-08-04 05:29:33,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:29:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:29:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-04 05:29:33,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5471923536439666 [2023-08-04 05:29:33,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-04 05:29:33,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-04 05:29:33,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:33,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-04 05:29:33,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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:29:33,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:29:33,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:29:33,894 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 187 flow. Second operand 3 states and 458 transitions. [2023-08-04 05:29:33,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 73 transitions, 344 flow [2023-08-04 05:29:33,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 73 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:29:33,898 INFO L231 Difference]: Finished difference. Result has 79 places, 58 transitions, 198 flow [2023-08-04 05:29:33,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=79, PETRI_TRANSITIONS=58} [2023-08-04 05:29:33,899 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2023-08-04 05:29:33,899 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 58 transitions, 198 flow [2023-08-04 05:29:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:33,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:33,899 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:29:33,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 05:29:33,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:29:33,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1997595612, now seen corresponding path program 1 times [2023-08-04 05:29:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453145857] [2023-08-04 05:29:33,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:33,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:29:33,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:29:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:29:33,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:29:33,997 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:29:33,997 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:29:33,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:29:33,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:29:33,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:29:33,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 05:29:33,998 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:29:33,998 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:29:33,999 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:29:34,000 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:29:34,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:29:34 BasicIcfg [2023-08-04 05:29:34,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:29:34,107 INFO L158 Benchmark]: Toolchain (without parser) took 216690.55ms. Allocated memory was 492.8MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 442.7MB in the beginning and 13.6GB in the end (delta: -13.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-04 05:29:34,107 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory was 311.5MB in the beginning and 311.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:29:34,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.19ms. Allocated memory is still 492.8MB. Free memory was 442.7MB in the beginning and 418.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:29:34,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.57ms. Allocated memory is still 492.8MB. Free memory was 418.2MB in the beginning and 415.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 05:29:34,108 INFO L158 Benchmark]: Boogie Preprocessor took 66.45ms. Allocated memory is still 492.8MB. Free memory was 415.4MB in the beginning and 413.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:29:34,108 INFO L158 Benchmark]: RCFGBuilder took 672.34ms. Allocated memory is still 492.8MB. Free memory was 413.3MB in the beginning and 437.7MB in the end (delta: -24.4MB). Peak memory consumption was 25.6MB. Max. memory is 16.0GB. [2023-08-04 05:29:34,108 INFO L158 Benchmark]: TraceAbstraction took 215401.63ms. Allocated memory was 492.8MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 436.7MB in the beginning and 13.6GB in the end (delta: -13.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-04 05:29:34,110 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.12ms. Allocated memory is still 360.7MB. Free memory was 311.5MB in the beginning and 311.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 495.19ms. Allocated memory is still 492.8MB. Free memory was 442.7MB in the beginning and 418.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.57ms. Allocated memory is still 492.8MB. Free memory was 418.2MB in the beginning and 415.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 66.45ms. Allocated memory is still 492.8MB. Free memory was 415.4MB in the beginning and 413.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 672.34ms. Allocated memory is still 492.8MB. Free memory was 413.3MB in the beginning and 437.7MB in the end (delta: -24.4MB). Peak memory consumption was 25.6MB. Max. memory is 16.0GB. * TraceAbstraction took 215401.63ms. Allocated memory was 492.8MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 436.7MB in the beginning and 13.6GB in the end (delta: -13.2GB). Peak memory consumption was 2.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.5s, 134 PlacesBefore, 40 PlacesAfterwards, 132 TransitionsBefore, 34 TransitionsAfterwards, 2732 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 112 TotalNumberOfCompositions, 6868 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3337, independent: 3158, independent conditional: 0, independent unconditional: 3158, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1465, independent: 1431, independent conditional: 0, independent unconditional: 1431, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3337, independent: 1727, independent conditional: 0, independent unconditional: 1727, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 1465, unknown conditional: 0, unknown unconditional: 1465] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 110 PlacesBefore, 33 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1440 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 2751 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1779, independent: 1675, independent conditional: 0, independent unconditional: 1675, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 764, independent: 748, independent conditional: 0, independent unconditional: 748, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1779, independent: 927, independent conditional: 0, independent unconditional: 927, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 764, unknown conditional: 0, unknown unconditional: 764] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 166 PlacesBefore, 66 PlacesAfterwards, 158 TransitionsBefore, 54 TransitionsAfterwards, 6652 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, 20336 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6679, independent: 6358, independent conditional: 0, independent unconditional: 6358, dependent: 321, dependent conditional: 0, dependent unconditional: 321, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3109, independent: 3051, independent conditional: 0, independent unconditional: 3051, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6679, independent: 3307, independent conditional: 0, independent unconditional: 3307, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 3109, unknown conditional: 0, unknown unconditional: 3109] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 293, Positive conditional cache size: 0, Positive unconditional cache size: 293, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L728] 0 _Bool y$flush_delayed; [L729] 0 int y$mem_tmp; [L730] 0 _Bool y$r_buff0_thd0; [L731] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$r_buff0_thd2; [L733] 0 _Bool y$r_buff0_thd3; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$read_delayed; [L739] 0 int *y$read_delayed_var; [L740] 0 int y$w_buff0; [L741] 0 _Bool y$w_buff0_used; [L742] 0 int y$w_buff1; [L743] 0 _Bool y$w_buff1_used; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t17[2]; [L854] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L854] COND TRUE 0 asdf<2 [L854] FCALL, FORK 0 pthread_create(&t17[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t17[asdf], ((void *)0), P0, ((void *)0))=-3, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L854] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L854] COND TRUE 0 asdf<2 [L854] FCALL, FORK 0 pthread_create(&t17[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t17[asdf], ((void *)0), P0, ((void *)0))=-2, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L854] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L854] COND FALSE 0 !(asdf<2) [L855] 0 pthread_t t18[2]; [L856] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L856] COND TRUE 0 asdf<2 [L856] FCALL, FORK 0 pthread_create(&t18[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t18[asdf], ((void *)0), P1, ((void *)0))=-1, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L856] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L856] COND TRUE 0 asdf<2 [L856] FCALL, FORK 0 pthread_create(&t18[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t18[asdf], ((void *)0), P1, ((void *)0))=0, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L856] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L856] COND FALSE 0 !(asdf<2) [L857] 0 pthread_t t19[2]; [L858] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] COND TRUE 0 asdf<2 [L858] FCALL, FORK 0 pthread_create(&t19[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t19[asdf], ((void *)0), P2, ((void *)0))=1, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 5 y$w_buff1 = y$w_buff0 [L801] 5 y$w_buff0 = 1 [L802] 5 y$w_buff1_used = y$w_buff0_used [L803] 5 y$w_buff0_used = (_Bool)1 [L804] CALL 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L804] RET 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L805] 5 y$r_buff1_thd0 = y$r_buff0_thd0 [L806] 5 y$r_buff1_thd1 = y$r_buff0_thd1 [L807] 5 y$r_buff1_thd2 = y$r_buff0_thd2 [L808] 5 y$r_buff1_thd3 = y$r_buff0_thd3 [L809] 5 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] COND TRUE 0 asdf<2 [L858] FCALL, FORK 0 pthread_create(&t19[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t19[asdf], ((void *)0), P2, ((void *)0))=2, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 6 y$w_buff1 = y$w_buff0 [L801] 6 y$w_buff0 = 1 [L802] 6 y$w_buff1_used = y$w_buff0_used [L803] 6 y$w_buff0_used = (_Bool)1 [L804] CALL 6 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND TRUE 6 !expression [L18] 6 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0, z=0] - UnprovableResult [Line: 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, 156 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 163 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 15 mSDtfsCounter, 163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 SizeOfPredicates, 0 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4/8 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, 182 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: 206.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 201.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 612 IncrementalHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 24 mSDtfsCounter, 612 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=6, InterpolantAutomatonStates: 20, 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.3s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 585 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 46/53 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, 156 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.9s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred 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:29:34,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...