/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_mix028_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:55:21,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:55:21,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:55:21,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:55:21,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:55:21,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:55:21,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:55:21,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:55:21,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:55:21,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:55:21,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:55:21,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:55:21,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:55:21,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:55:21,962 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:55:21,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:55:21,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:55:21,963 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:55:21,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:55:21,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:55:21,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:55:21,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:55:21,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:55:21,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:55:21,965 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:55:21,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:55:21,965 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:55:21,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:55:21,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:55:21,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:55:21,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:55:21,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:55:21,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:55:21,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:55:21,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:55:21,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:55:21,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:55:21,967 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:55:21,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:55:21,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:55:21,968 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:55:21,968 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:55:22,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:55:22,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:55:22,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:55:22,169 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:55:22,169 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:55:22,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix028_tso_bound2.i [2023-08-04 05:55:23,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:55:23,547 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:55:23,548 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix028_tso_bound2.i [2023-08-04 05:55:23,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee043f1b/0f83935012c1445281f24eff3309b7ae/FLAG8f1033fa4 [2023-08-04 05:55:23,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee043f1b/0f83935012c1445281f24eff3309b7ae [2023-08-04 05:55:23,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:55:23,602 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:55:23,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:55:23,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:55:23,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:55:23,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:55:23" (1/1) ... [2023-08-04 05:55:23,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f219ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:23, skipping insertion in model container [2023-08-04 05:55:23,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:55:23" (1/1) ... [2023-08-04 05:55:23,669 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:55:23,843 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_mix028_tso_bound2.i[944,957] [2023-08-04 05:55:24,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:55:24,076 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:55:24,085 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_mix028_tso_bound2.i[944,957] [2023-08-04 05:55:24,092 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:55:24,094 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:55:24,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:55:24,162 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:55:24,163 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:55:24,170 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:55:24,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24 WrapperNode [2023-08-04 05:55:24,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:55:24,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:55:24,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:55:24,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:55:24,178 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:55:24" (1/1) ... [2023-08-04 05:55:24,199 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:55:24" (1/1) ... [2023-08-04 05:55:24,254 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 189 [2023-08-04 05:55:24,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:55:24,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:55:24,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:55:24,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:55:24,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24" (1/1) ... [2023-08-04 05:55:24,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24" (1/1) ... [2023-08-04 05:55:24,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24" (1/1) ... [2023-08-04 05:55:24,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24" (1/1) ... [2023-08-04 05:55:24,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24" (1/1) ... [2023-08-04 05:55:24,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24" (1/1) ... [2023-08-04 05:55:24,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24" (1/1) ... [2023-08-04 05:55:24,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24" (1/1) ... [2023-08-04 05:55:24,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:55:24,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:55:24,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:55:24,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:55:24,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24" (1/1) ... [2023-08-04 05:55:24,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:55:24,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:55:24,339 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:55:24,340 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:55:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:55:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:55:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:55:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:55:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:55:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:55:24,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:55:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:55:24,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:55:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:55:24,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:55:24,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:55:24,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:55:24,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:55:24,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:55:24,369 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:55:24,535 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:55:24,538 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:55:24,945 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:55:25,057 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:55:25,057 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:55:25,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:55:25 BoogieIcfgContainer [2023-08-04 05:55:25,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:55:25,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:55:25,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:55:25,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:55:25,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:55:23" (1/3) ... [2023-08-04 05:55:25,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa126d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:55:25, skipping insertion in model container [2023-08-04 05:55:25,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:55:24" (2/3) ... [2023-08-04 05:55:25,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa126d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:55:25, skipping insertion in model container [2023-08-04 05:55:25,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:55:25" (3/3) ... [2023-08-04 05:55:25,066 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix028_tso_bound2.i [2023-08-04 05:55:25,073 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:55:25,081 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:55:25,081 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:55:25,081 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:55:25,119 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:55:25,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 05:55:25,274 INFO L124 PetriNetUnfolderBase]: 30/454 cut-off events. [2023-08-04 05:55:25,274 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:55:25,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 454 events. 30/454 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2018 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 267. Up to 16 conditions per place. [2023-08-04 05:55:25,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 05:55:25,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 127 transitions, 265 flow [2023-08-04 05:55:25,287 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:55:25,300 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 127 transitions, 265 flow [2023-08-04 05:55:25,302 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 127 transitions, 265 flow [2023-08-04 05:55:25,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 265 flow [2023-08-04 05:55:25,385 INFO L124 PetriNetUnfolderBase]: 30/451 cut-off events. [2023-08-04 05:55:25,385 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:55:25,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 451 events. 30/451 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1994 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 261. Up to 16 conditions per place. [2023-08-04 05:55:25,392 INFO L119 LiptonReduction]: Number of co-enabled transitions 2566 [2023-08-04 05:55:28,800 INFO L134 LiptonReduction]: Checked pairs total: 6289 [2023-08-04 05:55:28,801 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-04 05:55:28,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:55:28,817 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;@18527034, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:55:28,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:55:28,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:55:28,823 INFO L124 PetriNetUnfolderBase]: 1/23 cut-off events. [2023-08-04 05:55:28,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:55:28,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:55:28,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:55:28,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:55:28,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:55:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash 189416669, now seen corresponding path program 1 times [2023-08-04 05:55:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:55:28,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634333107] [2023-08-04 05:55:28,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:55:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:55:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:55:29,102 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:55:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:55:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634333107] [2023-08-04 05:55:29,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634333107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:55:29,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:55:29,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:55:29,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607428860] [2023-08-04 05:55:29,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:55:29,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:55:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:55:29,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:55:29,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:55:29,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-04 05:55:29,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:55:29,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:55:29,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-04 05:55:29,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:55:29,666 INFO L124 PetriNetUnfolderBase]: 1828/2911 cut-off events. [2023-08-04 05:55:29,667 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 05:55:29,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5777 conditions, 2911 events. 1828/2911 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16101 event pairs, 1176 based on Foata normal form. 105/2521 useless extension candidates. Maximal degree in co-relation 5764. Up to 2807 conditions per place. [2023-08-04 05:55:29,686 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 28 selfloop transitions, 2 changer transitions 1/35 dead transitions. [2023-08-04 05:55:29,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 143 flow [2023-08-04 05:55:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:55:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:55:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-08-04 05:55:29,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502092050209205 [2023-08-04 05:55:29,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-08-04 05:55:29,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-08-04 05:55:29,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:55:29,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-08-04 05:55:29,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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:55:29,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 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:55:29,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 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:55:29,726 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 77 flow. Second operand 3 states and 360 transitions. [2023-08-04 05:55:29,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 143 flow [2023-08-04 05:55:29,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 143 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:55:29,731 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 83 flow [2023-08-04 05:55:29,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-04 05:55:29,736 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-04 05:55:29,737 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 83 flow [2023-08-04 05:55:29,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:55:29,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:55:29,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:55:29,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:55:29,738 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:55:29,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:55:29,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1576997715, now seen corresponding path program 1 times [2023-08-04 05:55:29,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:55:29,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045280690] [2023-08-04 05:55:29,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:55:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:55:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:55:29,870 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:55:29,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:55:29,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045280690] [2023-08-04 05:55:29,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045280690] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:55:29,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093667270] [2023-08-04 05:55:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:55:29,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:55:29,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:55:29,881 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:55:29,888 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:55:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:55:29,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:55:29,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:55:30,001 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:55:30,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:55:30,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093667270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:55:30,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:55:30,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:55:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757759863] [2023-08-04 05:55:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:55:30,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:55:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:55:30,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:55:30,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:55:30,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-04 05:55:30,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:55:30,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:55:30,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-04 05:55:30,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:55:30,345 INFO L124 PetriNetUnfolderBase]: 1584/2481 cut-off events. [2023-08-04 05:55:30,345 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 05:55:30,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4923 conditions, 2481 events. 1584/2481 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12956 event pairs, 1374 based on Foata normal form. 0/2084 useless extension candidates. Maximal degree in co-relation 4907. Up to 2352 conditions per place. [2023-08-04 05:55:30,359 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 31 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2023-08-04 05:55:30,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 163 flow [2023-08-04 05:55:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:55:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:55:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-04 05:55:30,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504881450488145 [2023-08-04 05:55:30,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-04 05:55:30,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-04 05:55:30,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:55:30,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-04 05:55:30,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:55:30,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 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:55:30,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 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:55:30,376 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 83 flow. Second operand 3 states and 362 transitions. [2023-08-04 05:55:30,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 163 flow [2023-08-04 05:55:30,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 159 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:55:30,378 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 87 flow [2023-08-04 05:55:30,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-04 05:55:30,379 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-08-04 05:55:30,380 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 87 flow [2023-08-04 05:55:30,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:55:30,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:55:30,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:55:30,388 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:55:30,586 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:55:30,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:55:30,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:55:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash 252861990, now seen corresponding path program 1 times [2023-08-04 05:55:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:55:30,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617745048] [2023-08-04 05:55:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:55:30,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:55:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:55:30,682 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:55:30,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:55:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617745048] [2023-08-04 05:55:30,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617745048] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:55:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516824540] [2023-08-04 05:55:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:55:30,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:55:30,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:55:30,689 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:55:30,716 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:55:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:55:30,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:55:30,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:55:30,837 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:55:30,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:55:30,853 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:55:30,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516824540] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:55:30,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:55:30,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:55:30,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663957068] [2023-08-04 05:55:30,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:55:30,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:55:30,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:55:30,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:55:30,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:55:30,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 239 [2023-08-04 05:55:30,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 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:55:30,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:55:30,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 239 [2023-08-04 05:55:30,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:55:30,900 INFO L124 PetriNetUnfolderBase]: 4/16 cut-off events. [2023-08-04 05:55:30,900 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 05:55:30,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 16 events. 4/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 20 event pairs, 0 based on Foata normal form. 3/19 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2023-08-04 05:55:30,901 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2023-08-04 05:55:30,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 10 transitions, 43 flow [2023-08-04 05:55:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:55:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:55:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 442 transitions. [2023-08-04 05:55:30,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46234309623430964 [2023-08-04 05:55:30,902 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 442 transitions. [2023-08-04 05:55:30,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 442 transitions. [2023-08-04 05:55:30,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:55:30,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 442 transitions. [2023-08-04 05:55:30,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 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:55:30,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 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:55:30,906 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 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:55:30,906 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 87 flow. Second operand 4 states and 442 transitions. [2023-08-04 05:55:30,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 10 transitions, 43 flow [2023-08-04 05:55:30,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 10 transitions, 41 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:55:30,907 INFO L231 Difference]: Finished difference. Result has 17 places, 0 transitions, 0 flow [2023-08-04 05:55:30,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=17, PETRI_TRANSITIONS=0} [2023-08-04 05:55:30,907 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -22 predicate places. [2023-08-04 05:55:30,908 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 0 transitions, 0 flow [2023-08-04 05:55:30,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 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:55:30,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:55:30,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:55:30,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:55:30,919 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:55:31,117 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:55:31,118 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:55:31,120 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:55:31,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 05:55:31,162 INFO L124 PetriNetUnfolderBase]: 30/454 cut-off events. [2023-08-04 05:55:31,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:55:31,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 454 events. 30/454 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2018 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 267. Up to 16 conditions per place. [2023-08-04 05:55:31,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 05:55:31,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 100 transitions, 215 flow [2023-08-04 05:55:31,166 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:55:31,166 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 100 transitions, 215 flow [2023-08-04 05:55:31,167 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 100 transitions, 215 flow [2023-08-04 05:55:31,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 215 flow [2023-08-04 05:55:31,184 INFO L124 PetriNetUnfolderBase]: 6/222 cut-off events. [2023-08-04 05:55:31,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:55:31,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 222 events. 6/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 673 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 151. Up to 8 conditions per place. [2023-08-04 05:55:31,187 INFO L119 LiptonReduction]: Number of co-enabled transitions 1328 [2023-08-04 05:55:33,834 INFO L134 LiptonReduction]: Checked pairs total: 3510 [2023-08-04 05:55:33,834 INFO L136 LiptonReduction]: Total number of compositions: 79 [2023-08-04 05:55:33,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:55:33,836 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;@18527034, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:55:33,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:55:33,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:55:33,839 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 05:55:33,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:55:33,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:55:33,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:55:33,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:55:33,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:55:33,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1759659242, now seen corresponding path program 1 times [2023-08-04 05:55:33,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:55:33,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265112549] [2023-08-04 05:55:33,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:55:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:55:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:55:33,866 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:55:33,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:55:33,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265112549] [2023-08-04 05:55:33,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265112549] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:55:33,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:55:33,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:55:33,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161808853] [2023-08-04 05:55:33,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:55:33,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:55:33,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:55:33,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:55:33,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:55:33,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 208 [2023-08-04 05:55:33,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:55:33,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:55:33,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 208 [2023-08-04 05:55:33,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:55:33,961 INFO L124 PetriNetUnfolderBase]: 372/672 cut-off events. [2023-08-04 05:55:33,961 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 05:55:33,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 672 events. 372/672 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3195 event pairs, 210 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 1340. Up to 616 conditions per place. [2023-08-04 05:55:33,965 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 22 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 05:55:33,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 123 flow [2023-08-04 05:55:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:55:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:55:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-04 05:55:33,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2023-08-04 05:55:33,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-04 05:55:33,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-04 05:55:33,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:55:33,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-04 05:55:33,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:55:33,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:55:33,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:55:33,970 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 69 flow. Second operand 3 states and 352 transitions. [2023-08-04 05:55:33,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 123 flow [2023-08-04 05:55:33,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 123 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:55:33,971 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2023-08-04 05:55:33,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-04 05:55:33,972 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 05:55:33,972 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2023-08-04 05:55:33,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:55:33,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:55:33,973 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:55:33,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 05:55:33,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:55:33,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:55:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1765921581, now seen corresponding path program 1 times [2023-08-04 05:55:33,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:55:33,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984095434] [2023-08-04 05:55:33,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:55:33,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:55:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:55:33,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:55:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:55:34,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:55:34,019 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:55:34,019 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:55:34,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:55:34,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:55:34,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:55:34,019 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:55:34,020 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:55:34,021 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:55:34,021 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:55:34,046 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:55:34,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 154 transitions, 344 flow [2023-08-04 05:55:34,179 INFO L124 PetriNetUnfolderBase]: 93/1409 cut-off events. [2023-08-04 05:55:34,179 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:55:34,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 1409 events. 93/1409 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9823 event pairs, 0 based on Foata normal form. 0/1232 useless extension candidates. Maximal degree in co-relation 1014. Up to 54 conditions per place. [2023-08-04 05:55:34,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 154 transitions, 344 flow [2023-08-04 05:55:34,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 152 transitions, 332 flow [2023-08-04 05:55:34,191 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:55:34,191 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 152 transitions, 332 flow [2023-08-04 05:55:34,192 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 152 transitions, 332 flow [2023-08-04 05:55:34,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 152 transitions, 332 flow [2023-08-04 05:55:34,316 INFO L124 PetriNetUnfolderBase]: 93/1405 cut-off events. [2023-08-04 05:55:34,317 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-04 05:55:34,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1405 events. 93/1405 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9761 event pairs, 0 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 1005. Up to 54 conditions per place. [2023-08-04 05:55:34,349 INFO L119 LiptonReduction]: Number of co-enabled transitions 6220 [2023-08-04 05:55:37,752 INFO L134 LiptonReduction]: Checked pairs total: 19511 [2023-08-04 05:55:37,753 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-04 05:55:37,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:55:37,755 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;@18527034, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:55:37,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:55:37,758 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:55:37,759 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-08-04 05:55:37,759 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 05:55:37,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:55:37,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:55:37,759 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:55:37,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:55:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1598827690, now seen corresponding path program 1 times [2023-08-04 05:55:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:55:37,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124496366] [2023-08-04 05:55:37,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:55:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:55:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:55:37,784 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:55:37,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:55:37,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124496366] [2023-08-04 05:55:37,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124496366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:55:37,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:55:37,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:55:37,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880458340] [2023-08-04 05:55:37,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:55:37,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:55:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:55:37,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:55:37,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:55:37,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 271 [2023-08-04 05:55:37,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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:55:37,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:55:37,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 271 [2023-08-04 05:55:37,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:56:21,300 INFO L124 PetriNetUnfolderBase]: 378842/493467 cut-off events. [2023-08-04 05:56:21,301 INFO L125 PetriNetUnfolderBase]: For 5709/5709 co-relation queries the response was YES. [2023-08-04 05:56:22,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977630 conditions, 493467 events. 378842/493467 cut-off events. For 5709/5709 co-relation queries the response was YES. Maximal size of possible extension queue 13166. Compared 3429792 event pairs, 313476 based on Foata normal form. 10836/438663 useless extension candidates. Maximal degree in co-relation 282293. Up to 476892 conditions per place. [2023-08-04 05:56:24,505 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 43 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-04 05:56:24,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 228 flow [2023-08-04 05:56:24,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:56:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:56:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-04 05:56:24,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227552275522755 [2023-08-04 05:56:24,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-04 05:56:24,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-04 05:56:24,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:56:24,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-04 05:56:24,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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:56:24,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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:56:24,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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:56:24,511 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 132 flow. Second operand 3 states and 425 transitions. [2023-08-04 05:56:24,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 228 flow [2023-08-04 05:56:24,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 226 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 05:56:24,522 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 140 flow [2023-08-04 05:56:24,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-08-04 05:56:24,523 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2023-08-04 05:56:24,523 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 140 flow [2023-08-04 05:56:24,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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:56:24,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:56:24,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:56:24,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:56:24,524 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:56:24,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:56:24,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1961235103, now seen corresponding path program 1 times [2023-08-04 05:56:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:56:24,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385487721] [2023-08-04 05:56:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:56:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:56:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:56:24,570 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:56:24,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:56:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385487721] [2023-08-04 05:56:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385487721] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:56:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58261424] [2023-08-04 05:56:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:56:24,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:56:24,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:56:24,573 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:56:24,575 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:56:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:56:24,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:56:24,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:56:24,666 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:56:24,666 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:56:24,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58261424] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:56:24,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:56:24,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:56:24,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010224676] [2023-08-04 05:56:24,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:56:24,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:56:24,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:56:24,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:56:24,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:56:24,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 271 [2023-08-04 05:56:24,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:56:24,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:56:24,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 271 [2023-08-04 05:56:24,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:57:04,378 INFO L124 PetriNetUnfolderBase]: 366838/477976 cut-off events. [2023-08-04 05:57:04,378 INFO L125 PetriNetUnfolderBase]: For 4155/4155 co-relation queries the response was YES. [2023-08-04 05:57:05,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944453 conditions, 477976 events. 366838/477976 cut-off events. For 4155/4155 co-relation queries the response was YES. Maximal size of possible extension queue 13108. Compared 3338881 event pairs, 296770 based on Foata normal form. 0/417772 useless extension candidates. Maximal degree in co-relation 944416. Up to 460105 conditions per place. [2023-08-04 05:57:07,844 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 49 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-04 05:57:07,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 260 flow [2023-08-04 05:57:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:57:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:57:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-04 05:57:07,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276752767527675 [2023-08-04 05:57:07,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-04 05:57:07,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-04 05:57:07,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:57:07,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-04 05:57:07,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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:57:07,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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:57:07,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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:57:07,850 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 140 flow. Second operand 3 states and 429 transitions. [2023-08-04 05:57:07,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 260 flow [2023-08-04 05:57:07,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:57:07,852 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 150 flow [2023-08-04 05:57:07,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2023-08-04 05:57:07,853 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places. [2023-08-04 05:57:07,853 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 150 flow [2023-08-04 05:57:07,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:57:07,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:57:07,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:57:07,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 05:57:08,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:57:08,063 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:57:08,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:57:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1027090839, now seen corresponding path program 1 times [2023-08-04 05:57:08,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:57:08,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176486381] [2023-08-04 05:57:08,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:57:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:57:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:57:08,118 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:57:08,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:57:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176486381] [2023-08-04 05:57:08,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176486381] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:57:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128927792] [2023-08-04 05:57:08,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:57:08,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:57:08,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:57:08,121 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:57:08,123 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:57:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:57:08,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:57:08,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:57:08,227 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:57:08,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:57:08,243 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:57:08,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128927792] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:57:08,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:57:08,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:57:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98634351] [2023-08-04 05:57:08,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:57:08,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:57:08,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:57:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:57:08,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:57:08,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2023-08-04 05:57:08,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 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:57:08,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:57:08,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2023-08-04 05:57:08,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:57:39,279 INFO L124 PetriNetUnfolderBase]: 286810/370172 cut-off events. [2023-08-04 05:57:39,279 INFO L125 PetriNetUnfolderBase]: For 3501/3501 co-relation queries the response was YES. [2023-08-04 05:57:40,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732133 conditions, 370172 events. 286810/370172 cut-off events. For 3501/3501 co-relation queries the response was YES. Maximal size of possible extension queue 10510. Compared 2454480 event pairs, 193398 based on Foata normal form. 3/325202 useless extension candidates. Maximal degree in co-relation 259594. Up to 356836 conditions per place. [2023-08-04 05:57:41,930 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 47 selfloop transitions, 3 changer transitions 1/61 dead transitions. [2023-08-04 05:57:41,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 61 transitions, 268 flow [2023-08-04 05:57:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:57:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:57:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-04 05:57:41,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083025830258303 [2023-08-04 05:57:41,932 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-04 05:57:41,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-04 05:57:41,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:57:41,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-04 05:57:41,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 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:57:41,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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:57:41,936 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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:57:41,936 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 150 flow. Second operand 4 states and 551 transitions. [2023-08-04 05:57:41,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 61 transitions, 268 flow [2023-08-04 05:57:41,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 61 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:57:41,940 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 162 flow [2023-08-04 05:57:41,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-08-04 05:57:41,941 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 9 predicate places. [2023-08-04 05:57:41,941 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 162 flow [2023-08-04 05:57:41,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 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:57:41,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:57:41,941 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:57:41,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-04 05:57:42,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:57:42,152 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:57:42,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:57:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1803575825, now seen corresponding path program 1 times [2023-08-04 05:57:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:57:42,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036088237] [2023-08-04 05:57:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:57:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:57:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:57:42,211 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:57:42,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:57:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036088237] [2023-08-04 05:57:42,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036088237] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:57:42,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331012662] [2023-08-04 05:57:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:57:42,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:57:42,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:57:42,218 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:57:42,221 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:57:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:57:42,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:57:42,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:57:42,350 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:57:42,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:57:42,367 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:57:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331012662] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:57:42,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:57:42,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 05:57:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228239209] [2023-08-04 05:57:42,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:57:42,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:57:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:57:42,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:57:42,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:57:42,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2023-08-04 05:57:42,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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:57:42,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:57:42,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2023-08-04 05:57:42,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:07,460 INFO L124 PetriNetUnfolderBase]: 238048/305014 cut-off events. [2023-08-04 05:58:07,460 INFO L125 PetriNetUnfolderBase]: For 2637/2637 co-relation queries the response was YES. [2023-08-04 05:58:08,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603373 conditions, 305014 events. 238048/305014 cut-off events. For 2637/2637 co-relation queries the response was YES. Maximal size of possible extension queue 9399. Compared 1976012 event pairs, 153634 based on Foata normal form. 36/269329 useless extension candidates. Maximal degree in co-relation 213580. Up to 292876 conditions per place. [2023-08-04 05:58:09,574 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 58 selfloop transitions, 3 changer transitions 1/72 dead transitions. [2023-08-04 05:58:09,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 72 transitions, 324 flow [2023-08-04 05:58:09,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:58:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:58:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-08-04 05:58:09,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518450184501845 [2023-08-04 05:58:09,576 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-08-04 05:58:09,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-08-04 05:58:09,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:09,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-08-04 05:58:09,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 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:58:09,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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:58:09,580 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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:58:09,580 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 162 flow. Second operand 4 states and 562 transitions. [2023-08-04 05:58:09,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 72 transitions, 324 flow [2023-08-04 05:58:09,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 317 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:58:09,582 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 169 flow [2023-08-04 05:58:09,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2023-08-04 05:58:09,583 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2023-08-04 05:58:09,583 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 169 flow [2023-08-04 05:58:09,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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:58:09,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:09,584 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:58:09,593 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:58:09,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:58:09,789 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:58:09,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:09,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1892636700, now seen corresponding path program 1 times [2023-08-04 05:58:09,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:09,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239189767] [2023-08-04 05:58:09,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:09,921 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:58:09,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239189767] [2023-08-04 05:58:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239189767] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:58:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307615777] [2023-08-04 05:58:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:09,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:09,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 271 [2023-08-04 05:58:09,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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:58:09,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:09,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 271 [2023-08-04 05:58:09,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:31,870 INFO L124 PetriNetUnfolderBase]: 214312/275815 cut-off events. [2023-08-04 05:58:31,870 INFO L125 PetriNetUnfolderBase]: For 3565/3565 co-relation queries the response was YES. [2023-08-04 05:58:32,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544614 conditions, 275815 events. 214312/275815 cut-off events. For 3565/3565 co-relation queries the response was YES. Maximal size of possible extension queue 8775. Compared 1767666 event pairs, 39640 based on Foata normal form. 0/248590 useless extension candidates. Maximal degree in co-relation 192810. Up to 249409 conditions per place. [2023-08-04 05:58:33,723 INFO L140 encePairwiseOnDemand]: 266/271 looper letters, 61 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-04 05:58:33,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 74 transitions, 344 flow [2023-08-04 05:58:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-08-04 05:58:33,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5547355473554736 [2023-08-04 05:58:33,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-08-04 05:58:33,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-08-04 05:58:33,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:33,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-08-04 05:58:33,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:58:33,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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:58:33,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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:58:33,728 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 169 flow. Second operand 3 states and 451 transitions. [2023-08-04 05:58:33,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 74 transitions, 344 flow [2023-08-04 05:58:33,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 74 transitions, 337 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:58:33,732 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 183 flow [2023-08-04 05:58:33,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-08-04 05:58:33,733 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2023-08-04 05:58:33,733 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 183 flow [2023-08-04 05:58:33,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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:58:33,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:33,733 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:58:33,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 05:58:33,734 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:58:33,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1457832727, now seen corresponding path program 1 times [2023-08-04 05:58:33,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:33,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888693285] [2023-08-04 05:58:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:33,799 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:58:33,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:33,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888693285] [2023-08-04 05:58:33,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888693285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:33,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:33,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 05:58:33,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917321931] [2023-08-04 05:58:33,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:33,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:33,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:33,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:33,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 271 [2023-08-04 05:58:33,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:58:33,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:33,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 271 [2023-08-04 05:58:33,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:58,433 INFO L124 PetriNetUnfolderBase]: 211864/270199 cut-off events. [2023-08-04 05:58:58,433 INFO L125 PetriNetUnfolderBase]: For 14128/14128 co-relation queries the response was YES. [2023-08-04 05:58:59,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564478 conditions, 270199 events. 211864/270199 cut-off events. For 14128/14128 co-relation queries the response was YES. Maximal size of possible extension queue 8591. Compared 1704583 event pairs, 174592 based on Foata normal form. 0/242110 useless extension candidates. Maximal degree in co-relation 199239. Up to 257980 conditions per place. [2023-08-04 05:59:00,361 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 59 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-04 05:59:00,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 71 transitions, 340 flow [2023-08-04 05:59:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:59:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:59:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-04 05:59:00,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375153751537516 [2023-08-04 05:59:00,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-04 05:59:00,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-04 05:59:00,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:59:00,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-04 05:59:00,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:59:00,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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:59:00,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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:59:00,365 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 183 flow. Second operand 3 states and 437 transitions. [2023-08-04 05:59:00,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 71 transitions, 340 flow [2023-08-04 05:59:00,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:59:00,409 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 194 flow [2023-08-04 05:59:00,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=180, 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=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2023-08-04 05:59:00,409 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2023-08-04 05:59:00,410 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 194 flow [2023-08-04 05:59:00,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:59:00,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:59:00,410 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:59:00,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 05:59:00,410 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:59:00,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:59:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1028673411, now seen corresponding path program 1 times [2023-08-04 05:59:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:59:00,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537639022] [2023-08-04 05:59:00,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:59:00,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:59:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:59:00,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:59:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:59:00,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:59:00,477 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:59:00,477 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:59:00,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:59:00,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:59:00,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:59:00,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 05:59:00,477 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:59:00,478 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:59:00,481 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:59:00,481 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:59:00,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:59:00 BasicIcfg [2023-08-04 05:59:00,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:59:00,578 INFO L158 Benchmark]: Toolchain (without parser) took 216976.60ms. Allocated memory was 576.7MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 522.3MB in the beginning and 13.1GB in the end (delta: -12.6GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-04 05:59:00,578 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 352.3MB. Free memory was 299.4MB in the beginning and 299.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:59:00,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.02ms. Allocated memory is still 576.7MB. Free memory was 522.0MB in the beginning and 497.6MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-04 05:59:00,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.12ms. Allocated memory is still 576.7MB. Free memory was 497.6MB in the beginning and 494.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:59:00,579 INFO L158 Benchmark]: Boogie Preprocessor took 44.37ms. Allocated memory is still 576.7MB. Free memory was 494.6MB in the beginning and 492.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:59:00,579 INFO L158 Benchmark]: RCFGBuilder took 759.43ms. Allocated memory is still 576.7MB. Free memory was 492.5MB in the beginning and 510.0MB in the end (delta: -17.5MB). Peak memory consumption was 21.1MB. Max. memory is 16.0GB. [2023-08-04 05:59:00,579 INFO L158 Benchmark]: TraceAbstraction took 215516.33ms. Allocated memory was 576.7MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 508.9MB in the beginning and 13.1GB in the end (delta: -12.6GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-04 05:59:00,580 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 352.3MB. Free memory was 299.4MB in the beginning and 299.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 568.02ms. Allocated memory is still 576.7MB. Free memory was 522.0MB in the beginning and 497.6MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 83.12ms. Allocated memory is still 576.7MB. Free memory was 497.6MB in the beginning and 494.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.37ms. Allocated memory is still 576.7MB. Free memory was 494.6MB in the beginning and 492.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 759.43ms. Allocated memory is still 576.7MB. Free memory was 492.5MB in the beginning and 510.0MB in the end (delta: -17.5MB). Peak memory consumption was 21.1MB. Max. memory is 16.0GB. * TraceAbstraction took 215516.33ms. Allocated memory was 576.7MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 508.9MB in the beginning and 13.1GB in the end (delta: -12.6GB). Peak memory consumption was 2.8GB. 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, 129 PlacesBefore, 39 PlacesAfterwards, 127 TransitionsBefore, 33 TransitionsAfterwards, 2566 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 110 TotalNumberOfCompositions, 6289 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2425, independent: 2262, independent conditional: 0, independent unconditional: 2262, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1302, independent: 1269, independent conditional: 0, independent unconditional: 1269, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2425, independent: 993, independent conditional: 0, independent unconditional: 993, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 1302, unknown conditional: 0, unknown unconditional: 1302] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, 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.7s, 105 PlacesBefore, 34 PlacesAfterwards, 100 TransitionsBefore, 27 TransitionsAfterwards, 1328 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 3510 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1838, independent: 1696, independent conditional: 0, independent unconditional: 1696, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 679, independent: 664, independent conditional: 0, independent unconditional: 664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1838, independent: 1032, independent conditional: 0, independent unconditional: 1032, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 679, unknown conditional: 0, unknown unconditional: 679] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 160 PlacesBefore, 64 PlacesAfterwards, 152 TransitionsBefore, 52 TransitionsAfterwards, 6220 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 117 TotalNumberOfCompositions, 19511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6243, independent: 5914, independent conditional: 0, independent unconditional: 5914, dependent: 329, dependent conditional: 0, dependent unconditional: 329, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2873, independent: 2833, independent conditional: 0, independent unconditional: 2833, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6243, independent: 3081, independent conditional: 0, independent unconditional: 3081, dependent: 289, dependent conditional: 0, dependent unconditional: 289, unknown: 2873, unknown conditional: 0, unknown unconditional: 2873] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763[2]; [L832] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t763={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] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t763[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763[asdf], ((void *)0), P0, ((void *)0))=-5, t763={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] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t763={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] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t763[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763[asdf], ((void *)0), P0, ((void *)0))=-4, t763={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] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t763={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] [L832] COND FALSE 0 !(asdf<2) [L833] 0 pthread_t t764[2]; [L834] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t763={5:0}, t764={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] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t764[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t764[asdf], ((void *)0), P1, ((void *)0))=-3, t763={5:0}, t764={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] [L834] 0 asdf++ VAL [__unbuffered_cnt=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, t763={5:0}, t764={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] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t764[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t764[asdf], ((void *)0), P1, ((void *)0))=-2, t763={5:0}, t764={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] [L834] 0 asdf++ VAL [__unbuffered_cnt=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, t763={5:0}, t764={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] [L834] COND FALSE 0 !(asdf<2) [L835] 0 pthread_t t765[2]; [L836] 0 int asdf=0; VAL [__unbuffered_cnt=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, t763={5:0}, t764={6:0}, t765={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] [L836] COND TRUE 0 asdf<2 [L836] FCALL, FORK 0 pthread_create(&t765[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t765[asdf], ((void *)0), P2, ((void *)0))=-1, t763={5:0}, t764={6:0}, t765={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] [L778] 5 y$w_buff1 = y$w_buff0 [L779] 5 y$w_buff0 = 2 [L780] 5 y$w_buff1_used = y$w_buff0_used [L781] 5 y$w_buff0_used = (_Bool)1 [L782] CALL 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L782] RET 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 5 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 5 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 5 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 5 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 5 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L836] 0 asdf++ VAL [__unbuffered_cnt=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, t763={5:0}, t764={6:0}, t765={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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L836] COND TRUE 0 asdf<2 [L836] FCALL, FORK 0 pthread_create(&t765[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t765[asdf], ((void *)0), P2, ((void *)0))=0, t763={5:0}, t764={6:0}, t765={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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 6 y$w_buff1 = y$w_buff0 [L779] 6 y$w_buff0 = 2 [L780] 6 y$w_buff1_used = y$w_buff0_used [L781] 6 y$w_buff0_used = (_Bool)1 [L782] 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_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=2, y$w_buff0_used=1, y$w_buff1=2, 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, 150 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: 6.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 9 mSDtfsCounter, 157 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=87occurred 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.4s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 SizeOfPredicates, 0 NumberOfNonLiveVariables, 353 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, 175 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.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 201.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 631 IncrementalHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 17 mSDtfsCounter, 631 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=194occurred 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.4s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 561 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, 150 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: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 05:59:00,603 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...