/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:12:01,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:12:01,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:12:01,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:12:01,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:12:01,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:12:01,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:12:01,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:12:01,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:12:01,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:12:01,418 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:12:01,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:12:01,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:12:01,419 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:12:01,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:12:01,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:12:01,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:12:01,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:12:01,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:12:01,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:12:01,421 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:12:01,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:12:01,422 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:12:01,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:12:01,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:12:01,422 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:12:01,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:12:01,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:12:01,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:12:01,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:12:01,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:12:01,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:12:01,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:12:01,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:12:01,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:12:01,424 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:12:01,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:12:01,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:12:01,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:12:01,753 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:12:01,753 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:12:01,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.oepc.i [2023-08-26 12:12:03,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:12:03,295 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:12:03,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.oepc.i [2023-08-26 12:12:03,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f00defd/e2cf82ecb68446b095e7355c91689298/FLAG1f0852049 [2023-08-26 12:12:03,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f00defd/e2cf82ecb68446b095e7355c91689298 [2023-08-26 12:12:03,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:12:03,329 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:12:03,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:12:03,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:12:03,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:12:03,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69cac415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03, skipping insertion in model container [2023-08-26 12:12:03,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,399 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:12:03,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:12:03,777 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:12:03,803 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:12:03,804 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:12:03,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:12:03,892 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:12:03,892 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:12:03,899 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:12:03,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03 WrapperNode [2023-08-26 12:12:03,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:12:03,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:12:03,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:12:03,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:12:03,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,949 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2023-08-26 12:12:03,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:12:03,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:12:03,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:12:03,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:12:03,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:12:03,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:12:03,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:12:03,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:12:03,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (1/1) ... [2023-08-26 12:12:03,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:12:04,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:12:04,054 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-26 12:12:04,077 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-26 12:12:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:12:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:12:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:12:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:12:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:12:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:12:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:12:04,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:12:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:12:04,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:12:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:12:04,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:12:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:12:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:12:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:12:04,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:12:04,103 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:12:04,235 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:12:04,237 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:12:04,757 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:12:05,357 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:12:05,358 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:12:05,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:12:05 BoogieIcfgContainer [2023-08-26 12:12:05,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:12:05,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:12:05,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:12:05,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:12:05,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:12:03" (1/3) ... [2023-08-26 12:12:05,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f3dd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:12:05, skipping insertion in model container [2023-08-26 12:12:05,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:12:03" (2/3) ... [2023-08-26 12:12:05,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f3dd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:12:05, skipping insertion in model container [2023-08-26 12:12:05,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:12:05" (3/3) ... [2023-08-26 12:12:05,370 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_rmo.oepc.i [2023-08-26 12:12:05,389 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:12:05,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 49 error locations. [2023-08-26 12:12:05,389 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:12:05,524 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:12:05,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 175 transitions, 365 flow [2023-08-26 12:12:05,622 INFO L124 PetriNetUnfolderBase]: 3/172 cut-off events. [2023-08-26 12:12:05,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:12:05,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 3/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 282 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-08-26 12:12:05,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 175 transitions, 365 flow [2023-08-26 12:12:05,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 172 transitions, 353 flow [2023-08-26 12:12:05,636 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:12:05,644 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 172 transitions, 353 flow [2023-08-26 12:12:05,646 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 172 transitions, 353 flow [2023-08-26 12:12:05,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 172 transitions, 353 flow [2023-08-26 12:12:05,683 INFO L124 PetriNetUnfolderBase]: 3/172 cut-off events. [2023-08-26 12:12:05,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:12:05,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 3/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 279 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-08-26 12:12:05,688 INFO L119 LiptonReduction]: Number of co-enabled transitions 6480 [2023-08-26 12:12:23,243 INFO L134 LiptonReduction]: Checked pairs total: 39706 [2023-08-26 12:12:23,243 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-08-26 12:12:23,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:12:23,269 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=false, 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;@68df1273, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:12:23,270 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2023-08-26 12:12:23,271 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:12:23,271 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:12:23,271 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:12:23,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:23,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:12:23,272 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:23,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1057, now seen corresponding path program 1 times [2023-08-26 12:12:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109940940] [2023-08-26 12:12:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:23,405 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-26 12:12:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109940940] [2023-08-26 12:12:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109940940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:23,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:12:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192923416] [2023-08-26 12:12:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:23,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:12:23,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:23,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:12:23,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:12:23,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 312 [2023-08-26 12:12:23,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 163 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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-26 12:12:23,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:23,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 312 [2023-08-26 12:12:23,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:27,007 INFO L124 PetriNetUnfolderBase]: 16227/23174 cut-off events. [2023-08-26 12:12:27,007 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-08-26 12:12:27,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45994 conditions, 23174 events. 16227/23174 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2365. Compared 162032 event pairs, 16227 based on Foata normal form. 400/9860 useless extension candidates. Maximal degree in co-relation 45983. Up to 22724 conditions per place. [2023-08-26 12:12:27,175 INFO L140 encePairwiseOnDemand]: 284/312 looper letters, 42 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2023-08-26 12:12:27,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 189 flow [2023-08-26 12:12:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:12:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:12:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 320 transitions. [2023-08-26 12:12:27,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2023-08-26 12:12:27,194 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 320 transitions. [2023-08-26 12:12:27,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 320 transitions. [2023-08-26 12:12:27,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:27,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 320 transitions. [2023-08-26 12:12:27,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 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-26 12:12:27,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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-26 12:12:27,209 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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-26 12:12:27,211 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 163 flow. Second operand 2 states and 320 transitions. [2023-08-26 12:12:27,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 189 flow [2023-08-26 12:12:27,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:12:27,218 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 102 flow [2023-08-26 12:12:27,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-26 12:12:27,226 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -29 predicate places. [2023-08-26 12:12:27,227 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 102 flow [2023-08-26 12:12:27,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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-26 12:12:27,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:27,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:12:27,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:12:27,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:27,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:27,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1043220, now seen corresponding path program 1 times [2023-08-26 12:12:27,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:27,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954544431] [2023-08-26 12:12:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:27,520 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-26 12:12:27,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:27,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954544431] [2023-08-26 12:12:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954544431] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:27,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:27,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:12:27,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051139091] [2023-08-26 12:12:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:27,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:12:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:27,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:12:27,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:12:27,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 312 [2023-08-26 12:12:27,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-26 12:12:27,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:27,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 312 [2023-08-26 12:12:27,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:29,049 INFO L124 PetriNetUnfolderBase]: 7170/10416 cut-off events. [2023-08-26 12:12:29,050 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:12:29,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20684 conditions, 10416 events. 7170/10416 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 60804 event pairs, 7170 based on Foata normal form. 0/5716 useless extension candidates. Maximal degree in co-relation 20681. Up to 10191 conditions per place. [2023-08-26 12:12:29,091 INFO L140 encePairwiseOnDemand]: 301/312 looper letters, 35 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-08-26 12:12:29,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 154 flow [2023-08-26 12:12:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:12:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:12:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 12:12:29,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3856837606837607 [2023-08-26 12:12:29,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 12:12:29,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 12:12:29,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:29,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 12:12:29,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:12:29,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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-26 12:12:29,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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-26 12:12:29,098 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 102 flow. Second operand 3 states and 361 transitions. [2023-08-26 12:12:29,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 154 flow [2023-08-26 12:12:29,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:12:29,099 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2023-08-26 12:12:29,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-26 12:12:29,100 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -37 predicate places. [2023-08-26 12:12:29,100 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2023-08-26 12:12:29,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-26 12:12:29,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:29,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:12:29,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:12:29,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:29,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:29,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1043219, now seen corresponding path program 1 times [2023-08-26 12:12:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:29,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894423819] [2023-08-26 12:12:29,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:29,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:29,173 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-26 12:12:29,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894423819] [2023-08-26 12:12:29,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894423819] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:29,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:29,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:12:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563867206] [2023-08-26 12:12:29,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:29,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:12:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:29,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:12:29,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:12:29,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 312 [2023-08-26 12:12:29,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-26 12:12:29,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:29,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 312 [2023-08-26 12:12:29,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:29,886 INFO L124 PetriNetUnfolderBase]: 3219/5039 cut-off events. [2023-08-26 12:12:29,886 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:12:29,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10060 conditions, 5039 events. 3219/5039 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 30174 event pairs, 2005 based on Foata normal form. 0/4090 useless extension candidates. Maximal degree in co-relation 10056. Up to 2962 conditions per place. [2023-08-26 12:12:29,909 INFO L140 encePairwiseOnDemand]: 293/312 looper letters, 35 selfloop transitions, 9 changer transitions 1/46 dead transitions. [2023-08-26 12:12:29,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 190 flow [2023-08-26 12:12:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:12:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:12:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-26 12:12:29,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38247863247863245 [2023-08-26 12:12:29,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-26 12:12:29,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-26 12:12:29,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:29,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-26 12:12:29,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:12:29,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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-26 12:12:29,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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-26 12:12:29,915 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 3 states and 358 transitions. [2023-08-26 12:12:29,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 190 flow [2023-08-26 12:12:29,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:12:29,917 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 153 flow [2023-08-26 12:12:29,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-08-26 12:12:29,918 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -37 predicate places. [2023-08-26 12:12:29,919 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 153 flow [2023-08-26 12:12:29,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-26 12:12:29,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:29,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:29,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:12:29,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:29,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash -489460662, now seen corresponding path program 1 times [2023-08-26 12:12:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:29,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394252783] [2023-08-26 12:12:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:30,177 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-26 12:12:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394252783] [2023-08-26 12:12:30,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394252783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:30,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:30,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:12:30,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926015444] [2023-08-26 12:12:30,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:30,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:12:30,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:30,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:12:30,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:12:30,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 312 [2023-08-26 12:12:30,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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-26 12:12:30,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:30,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 312 [2023-08-26 12:12:30,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:30,923 INFO L124 PetriNetUnfolderBase]: 2789/4664 cut-off events. [2023-08-26 12:12:30,923 INFO L125 PetriNetUnfolderBase]: For 1817/1857 co-relation queries the response was YES. [2023-08-26 12:12:30,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12662 conditions, 4664 events. 2789/4664 cut-off events. For 1817/1857 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 30872 event pairs, 1059 based on Foata normal form. 21/4332 useless extension candidates. Maximal degree in co-relation 12657. Up to 2670 conditions per place. [2023-08-26 12:12:30,947 INFO L140 encePairwiseOnDemand]: 308/312 looper letters, 59 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2023-08-26 12:12:30,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 375 flow [2023-08-26 12:12:30,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:12:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:12:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-26 12:12:30,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45405982905982906 [2023-08-26 12:12:30,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-26 12:12:30,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-26 12:12:30,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:30,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-26 12:12:30,951 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-26 12:12:30,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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-26 12:12:30,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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-26 12:12:30,953 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 153 flow. Second operand 3 states and 425 transitions. [2023-08-26 12:12:30,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 375 flow [2023-08-26 12:12:30,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:12:30,967 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 148 flow [2023-08-26 12:12:30,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-08-26 12:12:30,968 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -37 predicate places. [2023-08-26 12:12:30,968 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 148 flow [2023-08-26 12:12:30,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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-26 12:12:30,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:30,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:30,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:12:30,969 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:30,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash -489460474, now seen corresponding path program 1 times [2023-08-26 12:12:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:30,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211685381] [2023-08-26 12:12:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:31,155 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-26 12:12:31,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211685381] [2023-08-26 12:12:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211685381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:31,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:12:31,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857697836] [2023-08-26 12:12:31,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:31,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:12:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:31,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:12:31,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:12:31,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 312 [2023-08-26 12:12:31,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-26 12:12:31,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:31,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 312 [2023-08-26 12:12:31,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:31,772 INFO L124 PetriNetUnfolderBase]: 2704/4364 cut-off events. [2023-08-26 12:12:31,772 INFO L125 PetriNetUnfolderBase]: For 1585/1597 co-relation queries the response was YES. [2023-08-26 12:12:31,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12188 conditions, 4364 events. 2704/4364 cut-off events. For 1585/1597 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 27981 event pairs, 617 based on Foata normal form. 0/3719 useless extension candidates. Maximal degree in co-relation 12182. Up to 3527 conditions per place. [2023-08-26 12:12:31,796 INFO L140 encePairwiseOnDemand]: 309/312 looper letters, 56 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-26 12:12:31,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 350 flow [2023-08-26 12:12:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:12:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:12:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-26 12:12:31,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44551282051282054 [2023-08-26 12:12:31,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-26 12:12:31,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-26 12:12:31,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:31,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-26 12:12:31,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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-26 12:12:31,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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-26 12:12:31,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 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-26 12:12:31,807 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 148 flow. Second operand 3 states and 417 transitions. [2023-08-26 12:12:31,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 350 flow [2023-08-26 12:12:31,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:12:31,810 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 150 flow [2023-08-26 12:12:31,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-26 12:12:31,813 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -36 predicate places. [2023-08-26 12:12:31,814 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 150 flow [2023-08-26 12:12:31,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-26 12:12:31,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:31,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:31,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:12:31,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:31,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:31,815 INFO L85 PathProgramCache]: Analyzing trace with hash -573458783, now seen corresponding path program 1 times [2023-08-26 12:12:31,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:31,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552219170] [2023-08-26 12:12:31,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:31,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:32,062 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-26 12:12:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552219170] [2023-08-26 12:12:32,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552219170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:32,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:32,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:12:32,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148727607] [2023-08-26 12:12:32,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:32,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:12:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:32,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:12:32,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:12:32,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 312 [2023-08-26 12:12:32,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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-26 12:12:32,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:32,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 312 [2023-08-26 12:12:32,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:32,658 INFO L124 PetriNetUnfolderBase]: 2873/4762 cut-off events. [2023-08-26 12:12:32,658 INFO L125 PetriNetUnfolderBase]: For 885/885 co-relation queries the response was YES. [2023-08-26 12:12:32,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13144 conditions, 4762 events. 2873/4762 cut-off events. For 885/885 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 30597 event pairs, 1077 based on Foata normal form. 0/4054 useless extension candidates. Maximal degree in co-relation 13137. Up to 2852 conditions per place. [2023-08-26 12:12:32,676 INFO L140 encePairwiseOnDemand]: 309/312 looper letters, 68 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-26 12:12:32,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 399 flow [2023-08-26 12:12:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:12:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:12:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2023-08-26 12:12:32,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2023-08-26 12:12:32,679 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2023-08-26 12:12:32,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2023-08-26 12:12:32,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:32,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2023-08-26 12:12:32,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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-26 12:12:32,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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-26 12:12:32,683 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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-26 12:12:32,683 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 150 flow. Second operand 4 states and 455 transitions. [2023-08-26 12:12:32,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 399 flow [2023-08-26 12:12:32,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:12:32,686 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 148 flow [2023-08-26 12:12:32,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-26 12:12:32,687 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -36 predicate places. [2023-08-26 12:12:32,687 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 148 flow [2023-08-26 12:12:32,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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-26 12:12:32,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:32,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:32,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:12:32,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:32,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2006593392, now seen corresponding path program 1 times [2023-08-26 12:12:32,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:32,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773343039] [2023-08-26 12:12:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:32,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:33,435 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-26 12:12:33,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:33,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773343039] [2023-08-26 12:12:33,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773343039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:33,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:33,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:12:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16907008] [2023-08-26 12:12:33,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:33,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:12:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:33,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:12:33,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:12:33,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 312 [2023-08-26 12:12:33,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 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-26 12:12:33,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:33,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 312 [2023-08-26 12:12:33,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:34,302 INFO L124 PetriNetUnfolderBase]: 3065/4913 cut-off events. [2023-08-26 12:12:34,302 INFO L125 PetriNetUnfolderBase]: For 1143/1143 co-relation queries the response was YES. [2023-08-26 12:12:34,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14142 conditions, 4913 events. 3065/4913 cut-off events. For 1143/1143 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 31013 event pairs, 919 based on Foata normal form. 76/4449 useless extension candidates. Maximal degree in co-relation 14135. Up to 1769 conditions per place. [2023-08-26 12:12:34,319 INFO L140 encePairwiseOnDemand]: 295/312 looper letters, 101 selfloop transitions, 32 changer transitions 0/134 dead transitions. [2023-08-26 12:12:34,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 134 transitions, 744 flow [2023-08-26 12:12:34,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:12:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:12:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1066 transitions. [2023-08-26 12:12:34,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2023-08-26 12:12:34,324 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1066 transitions. [2023-08-26 12:12:34,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1066 transitions. [2023-08-26 12:12:34,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:34,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1066 transitions. [2023-08-26 12:12:34,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.6) internal successors, (1066), 10 states have internal predecessors, (1066), 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-26 12:12:34,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 312.0) internal successors, (3432), 11 states have internal predecessors, (3432), 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-26 12:12:34,332 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 312.0) internal successors, (3432), 11 states have internal predecessors, (3432), 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-26 12:12:34,332 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 148 flow. Second operand 10 states and 1066 transitions. [2023-08-26 12:12:34,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 134 transitions, 744 flow [2023-08-26 12:12:34,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 134 transitions, 731 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:12:34,336 INFO L231 Difference]: Finished difference. Result has 56 places, 68 transitions, 381 flow [2023-08-26 12:12:34,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=381, PETRI_PLACES=56, PETRI_TRANSITIONS=68} [2023-08-26 12:12:34,336 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -29 predicate places. [2023-08-26 12:12:34,337 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 68 transitions, 381 flow [2023-08-26 12:12:34,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 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-26 12:12:34,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:34,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:34,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:12:34,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:34,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:34,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1757229606, now seen corresponding path program 1 times [2023-08-26 12:12:34,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:34,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501378704] [2023-08-26 12:12:34,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:34,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:34,544 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-26 12:12:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501378704] [2023-08-26 12:12:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501378704] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:34,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:34,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:12:34,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435622451] [2023-08-26 12:12:34,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:34,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:12:34,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:34,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:12:34,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:12:34,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 312 [2023-08-26 12:12:34,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 68 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 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-26 12:12:34,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:34,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 312 [2023-08-26 12:12:34,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:35,424 INFO L124 PetriNetUnfolderBase]: 4803/7669 cut-off events. [2023-08-26 12:12:35,424 INFO L125 PetriNetUnfolderBase]: For 7013/7106 co-relation queries the response was YES. [2023-08-26 12:12:35,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25674 conditions, 7669 events. 4803/7669 cut-off events. For 7013/7106 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 51889 event pairs, 1318 based on Foata normal form. 117/7407 useless extension candidates. Maximal degree in co-relation 25666. Up to 2850 conditions per place. [2023-08-26 12:12:35,453 INFO L140 encePairwiseOnDemand]: 308/312 looper letters, 117 selfloop transitions, 3 changer transitions 0/131 dead transitions. [2023-08-26 12:12:35,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 131 transitions, 943 flow [2023-08-26 12:12:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:12:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:12:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-08-26 12:12:35,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44310897435897434 [2023-08-26 12:12:35,455 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-08-26 12:12:35,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-08-26 12:12:35,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:35,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-08-26 12:12:35,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 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-26 12:12:35,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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-26 12:12:35,460 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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-26 12:12:35,460 INFO L175 Difference]: Start difference. First operand has 56 places, 68 transitions, 381 flow. Second operand 4 states and 553 transitions. [2023-08-26 12:12:35,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 131 transitions, 943 flow [2023-08-26 12:12:35,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 131 transitions, 942 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:12:35,470 INFO L231 Difference]: Finished difference. Result has 60 places, 69 transitions, 399 flow [2023-08-26 12:12:35,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2023-08-26 12:12:35,471 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -25 predicate places. [2023-08-26 12:12:35,471 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 399 flow [2023-08-26 12:12:35,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 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-26 12:12:35,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:35,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:35,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:12:35,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:35,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2074905405, now seen corresponding path program 1 times [2023-08-26 12:12:35,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:35,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175866154] [2023-08-26 12:12:35,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:35,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:35,642 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-26 12:12:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:35,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175866154] [2023-08-26 12:12:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175866154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:35,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:35,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:12:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862292952] [2023-08-26 12:12:35,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:35,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:12:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:35,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:12:35,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:12:35,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 312 [2023-08-26 12:12:35,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 399 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 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-26 12:12:35,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:35,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 312 [2023-08-26 12:12:35,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:36,382 INFO L124 PetriNetUnfolderBase]: 3337/5305 cut-off events. [2023-08-26 12:12:36,382 INFO L125 PetriNetUnfolderBase]: For 3666/3682 co-relation queries the response was YES. [2023-08-26 12:12:36,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18416 conditions, 5305 events. 3337/5305 cut-off events. For 3666/3682 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 32124 event pairs, 1463 based on Foata normal form. 122/5250 useless extension candidates. Maximal degree in co-relation 18406. Up to 2043 conditions per place. [2023-08-26 12:12:36,403 INFO L140 encePairwiseOnDemand]: 297/312 looper letters, 61 selfloop transitions, 32 changer transitions 0/94 dead transitions. [2023-08-26 12:12:36,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 715 flow [2023-08-26 12:12:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:12:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:12:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-08-26 12:12:36,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359775641025641 [2023-08-26 12:12:36,405 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-08-26 12:12:36,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-08-26 12:12:36,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:36,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-08-26 12:12:36,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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-26 12:12:36,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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-26 12:12:36,409 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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-26 12:12:36,409 INFO L175 Difference]: Start difference. First operand has 60 places, 69 transitions, 399 flow. Second operand 4 states and 449 transitions. [2023-08-26 12:12:36,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 715 flow [2023-08-26 12:12:36,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 94 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:12:36,418 INFO L231 Difference]: Finished difference. Result has 63 places, 78 transitions, 590 flow [2023-08-26 12:12:36,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=590, PETRI_PLACES=63, PETRI_TRANSITIONS=78} [2023-08-26 12:12:36,419 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -22 predicate places. [2023-08-26 12:12:36,419 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 590 flow [2023-08-26 12:12:36,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 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-26 12:12:36,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:36,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:36,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:12:36,420 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:36,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:36,420 INFO L85 PathProgramCache]: Analyzing trace with hash 280229977, now seen corresponding path program 1 times [2023-08-26 12:12:36,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:36,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706744842] [2023-08-26 12:12:36,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:36,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:38,510 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-26 12:12:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:38,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706744842] [2023-08-26 12:12:38,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706744842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:38,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:38,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:12:38,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352331951] [2023-08-26 12:12:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:38,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:12:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:12:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:12:38,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 312 [2023-08-26 12:12:38,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 590 flow. Second operand has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 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-26 12:12:38,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:38,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 312 [2023-08-26 12:12:38,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:39,409 INFO L124 PetriNetUnfolderBase]: 3448/5456 cut-off events. [2023-08-26 12:12:39,409 INFO L125 PetriNetUnfolderBase]: For 6039/6055 co-relation queries the response was YES. [2023-08-26 12:12:39,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21520 conditions, 5456 events. 3448/5456 cut-off events. For 6039/6055 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 33354 event pairs, 995 based on Foata normal form. 18/5297 useless extension candidates. Maximal degree in co-relation 21509. Up to 5031 conditions per place. [2023-08-26 12:12:39,435 INFO L140 encePairwiseOnDemand]: 302/312 looper letters, 113 selfloop transitions, 40 changer transitions 0/154 dead transitions. [2023-08-26 12:12:39,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 154 transitions, 1381 flow [2023-08-26 12:12:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:12:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:12:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 957 transitions. [2023-08-26 12:12:39,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30673076923076925 [2023-08-26 12:12:39,439 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 957 transitions. [2023-08-26 12:12:39,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 957 transitions. [2023-08-26 12:12:39,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:39,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 957 transitions. [2023-08-26 12:12:39,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.7) internal successors, (957), 10 states have internal predecessors, (957), 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-26 12:12:39,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 312.0) internal successors, (3432), 11 states have internal predecessors, (3432), 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-26 12:12:39,446 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 312.0) internal successors, (3432), 11 states have internal predecessors, (3432), 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-26 12:12:39,446 INFO L175 Difference]: Start difference. First operand has 63 places, 78 transitions, 590 flow. Second operand 10 states and 957 transitions. [2023-08-26 12:12:39,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 154 transitions, 1381 flow [2023-08-26 12:12:39,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 154 transitions, 1375 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:12:39,470 INFO L231 Difference]: Finished difference. Result has 77 places, 115 transitions, 1035 flow [2023-08-26 12:12:39,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1035, PETRI_PLACES=77, PETRI_TRANSITIONS=115} [2023-08-26 12:12:39,471 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -8 predicate places. [2023-08-26 12:12:39,471 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 115 transitions, 1035 flow [2023-08-26 12:12:39,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 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-26 12:12:39,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:39,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:39,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:12:39,472 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:39,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash -102442349, now seen corresponding path program 1 times [2023-08-26 12:12:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:39,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553536156] [2023-08-26 12:12:39,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:39,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:39,649 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-26 12:12:39,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:39,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553536156] [2023-08-26 12:12:39,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553536156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:39,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:39,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:12:39,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390686346] [2023-08-26 12:12:39,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:39,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:12:39,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:39,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:12:39,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:12:39,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 312 [2023-08-26 12:12:39,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 115 transitions, 1035 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 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-26 12:12:39,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:39,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 312 [2023-08-26 12:12:39,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:40,413 INFO L124 PetriNetUnfolderBase]: 2632/4220 cut-off events. [2023-08-26 12:12:40,414 INFO L125 PetriNetUnfolderBase]: For 6430/6445 co-relation queries the response was YES. [2023-08-26 12:12:40,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17247 conditions, 4220 events. 2632/4220 cut-off events. For 6430/6445 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24552 event pairs, 1054 based on Foata normal form. 131/4263 useless extension candidates. Maximal degree in co-relation 17229. Up to 1876 conditions per place. [2023-08-26 12:12:40,440 INFO L140 encePairwiseOnDemand]: 296/312 looper letters, 115 selfloop transitions, 27 changer transitions 0/143 dead transitions. [2023-08-26 12:12:40,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 143 transitions, 1441 flow [2023-08-26 12:12:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:12:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:12:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2023-08-26 12:12:40,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.343482905982906 [2023-08-26 12:12:40,443 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2023-08-26 12:12:40,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2023-08-26 12:12:40,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:40,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2023-08-26 12:12:40,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 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-26 12:12:40,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 312.0) internal successors, (2184), 7 states have internal predecessors, (2184), 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-26 12:12:40,447 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 312.0) internal successors, (2184), 7 states have internal predecessors, (2184), 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-26 12:12:40,447 INFO L175 Difference]: Start difference. First operand has 77 places, 115 transitions, 1035 flow. Second operand 6 states and 643 transitions. [2023-08-26 12:12:40,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 143 transitions, 1441 flow [2023-08-26 12:12:40,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 143 transitions, 1428 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-26 12:12:40,488 INFO L231 Difference]: Finished difference. Result has 82 places, 115 transitions, 1103 flow [2023-08-26 12:12:40,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1103, PETRI_PLACES=82, PETRI_TRANSITIONS=115} [2023-08-26 12:12:40,489 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places. [2023-08-26 12:12:40,489 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 115 transitions, 1103 flow [2023-08-26 12:12:40,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 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-26 12:12:40,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:40,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:40,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:12:40,490 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:40,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:40,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1322239785, now seen corresponding path program 1 times [2023-08-26 12:12:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:40,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071884003] [2023-08-26 12:12:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:41,370 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-26 12:12:41,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:41,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071884003] [2023-08-26 12:12:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071884003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:41,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:12:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945812101] [2023-08-26 12:12:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:41,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:12:41,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:41,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:12:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:12:41,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 312 [2023-08-26 12:12:41,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 115 transitions, 1103 flow. Second operand has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 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-26 12:12:41,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:41,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 312 [2023-08-26 12:12:41,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:42,210 INFO L124 PetriNetUnfolderBase]: 3149/5137 cut-off events. [2023-08-26 12:12:42,210 INFO L125 PetriNetUnfolderBase]: For 10272/10295 co-relation queries the response was YES. [2023-08-26 12:12:42,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22895 conditions, 5137 events. 3149/5137 cut-off events. For 10272/10295 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 32107 event pairs, 1472 based on Foata normal form. 31/5020 useless extension candidates. Maximal degree in co-relation 22875. Up to 4039 conditions per place. [2023-08-26 12:12:42,240 INFO L140 encePairwiseOnDemand]: 305/312 looper letters, 114 selfloop transitions, 50 changer transitions 0/170 dead transitions. [2023-08-26 12:12:42,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 170 transitions, 1942 flow [2023-08-26 12:12:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:12:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:12:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-26 12:12:42,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38060897435897434 [2023-08-26 12:12:42,242 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-26 12:12:42,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-26 12:12:42,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:42,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-26 12:12:42,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 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-26 12:12:42,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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-26 12:12:42,246 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 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-26 12:12:42,246 INFO L175 Difference]: Start difference. First operand has 82 places, 115 transitions, 1103 flow. Second operand 4 states and 475 transitions. [2023-08-26 12:12:42,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 170 transitions, 1942 flow [2023-08-26 12:12:42,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 170 transitions, 1876 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:12:42,339 INFO L231 Difference]: Finished difference. Result has 82 places, 143 transitions, 1523 flow [2023-08-26 12:12:42,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1523, PETRI_PLACES=82, PETRI_TRANSITIONS=143} [2023-08-26 12:12:42,340 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places. [2023-08-26 12:12:42,340 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 143 transitions, 1523 flow [2023-08-26 12:12:42,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 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-26 12:12:42,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:42,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:42,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:12:42,341 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:42,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash -770052601, now seen corresponding path program 1 times [2023-08-26 12:12:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:42,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468567696] [2023-08-26 12:12:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:42,535 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-26 12:12:42,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468567696] [2023-08-26 12:12:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468567696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:42,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:42,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:12:42,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997551231] [2023-08-26 12:12:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:42,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:12:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:42,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:12:42,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:12:42,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 312 [2023-08-26 12:12:42,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 143 transitions, 1523 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 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-26 12:12:42,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:42,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 312 [2023-08-26 12:12:42,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:43,036 INFO L124 PetriNetUnfolderBase]: 1475/2633 cut-off events. [2023-08-26 12:12:43,036 INFO L125 PetriNetUnfolderBase]: For 6233/6426 co-relation queries the response was YES. [2023-08-26 12:12:43,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12003 conditions, 2633 events. 1475/2633 cut-off events. For 6233/6426 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16175 event pairs, 235 based on Foata normal form. 177/2732 useless extension candidates. Maximal degree in co-relation 11982. Up to 2018 conditions per place. [2023-08-26 12:12:43,048 INFO L140 encePairwiseOnDemand]: 306/312 looper letters, 104 selfloop transitions, 4 changer transitions 27/155 dead transitions. [2023-08-26 12:12:43,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 155 transitions, 1630 flow [2023-08-26 12:12:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:12:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:12:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-08-26 12:12:43,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41602564102564105 [2023-08-26 12:12:43,051 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-08-26 12:12:43,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-08-26 12:12:43,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:43,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-08-26 12:12:43,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 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-26 12:12:43,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 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-26 12:12:43,054 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 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-26 12:12:43,054 INFO L175 Difference]: Start difference. First operand has 82 places, 143 transitions, 1523 flow. Second operand 5 states and 649 transitions. [2023-08-26 12:12:43,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 155 transitions, 1630 flow [2023-08-26 12:12:43,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 155 transitions, 1540 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-26 12:12:43,090 INFO L231 Difference]: Finished difference. Result has 81 places, 111 transitions, 1054 flow [2023-08-26 12:12:43,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1054, PETRI_PLACES=81, PETRI_TRANSITIONS=111} [2023-08-26 12:12:43,090 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -4 predicate places. [2023-08-26 12:12:43,090 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 111 transitions, 1054 flow [2023-08-26 12:12:43,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 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-26 12:12:43,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:43,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:43,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:12:43,091 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:43,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash 654021909, now seen corresponding path program 1 times [2023-08-26 12:12:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:43,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992450468] [2023-08-26 12:12:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:43,272 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-26 12:12:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:43,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992450468] [2023-08-26 12:12:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992450468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:43,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:43,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:12:43,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491604839] [2023-08-26 12:12:43,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:43,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:12:43,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:43,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:12:43,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:12:43,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 312 [2023-08-26 12:12:43,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 111 transitions, 1054 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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-26 12:12:43,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:43,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 312 [2023-08-26 12:12:43,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:43,564 INFO L124 PetriNetUnfolderBase]: 436/868 cut-off events. [2023-08-26 12:12:43,565 INFO L125 PetriNetUnfolderBase]: For 1812/1897 co-relation queries the response was YES. [2023-08-26 12:12:43,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3856 conditions, 868 events. 436/868 cut-off events. For 1812/1897 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4393 event pairs, 31 based on Foata normal form. 97/951 useless extension candidates. Maximal degree in co-relation 3835. Up to 355 conditions per place. [2023-08-26 12:12:43,569 INFO L140 encePairwiseOnDemand]: 306/312 looper letters, 63 selfloop transitions, 7 changer transitions 40/121 dead transitions. [2023-08-26 12:12:43,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 1133 flow [2023-08-26 12:12:43,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:12:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:12:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2023-08-26 12:12:43,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4150641025641026 [2023-08-26 12:12:43,572 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2023-08-26 12:12:43,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2023-08-26 12:12:43,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:43,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2023-08-26 12:12:43,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 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-26 12:12:43,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 312.0) internal successors, (2184), 7 states have internal predecessors, (2184), 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-26 12:12:43,577 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 312.0) internal successors, (2184), 7 states have internal predecessors, (2184), 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-26 12:12:43,577 INFO L175 Difference]: Start difference. First operand has 81 places, 111 transitions, 1054 flow. Second operand 6 states and 777 transitions. [2023-08-26 12:12:43,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 1133 flow [2023-08-26 12:12:43,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 121 transitions, 1084 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-26 12:12:43,584 INFO L231 Difference]: Finished difference. Result has 81 places, 58 transitions, 441 flow [2023-08-26 12:12:43,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=81, PETRI_TRANSITIONS=58} [2023-08-26 12:12:43,584 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -4 predicate places. [2023-08-26 12:12:43,584 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 58 transitions, 441 flow [2023-08-26 12:12:43,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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-26 12:12:43,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:43,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:43,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:12:43,585 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:43,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1548673122, now seen corresponding path program 1 times [2023-08-26 12:12:43,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:43,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562974425] [2023-08-26 12:12:43,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:43,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:44,865 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-26 12:12:44,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:44,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562974425] [2023-08-26 12:12:44,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562974425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:44,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:44,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:12:44,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575182198] [2023-08-26 12:12:44,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:44,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:12:44,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:44,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:12:44,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:12:44,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 312 [2023-08-26 12:12:44,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 58 transitions, 441 flow. Second operand has 10 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 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-26 12:12:44,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:44,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 312 [2023-08-26 12:12:44,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:45,346 INFO L124 PetriNetUnfolderBase]: 467/1017 cut-off events. [2023-08-26 12:12:45,346 INFO L125 PetriNetUnfolderBase]: For 2923/2925 co-relation queries the response was YES. [2023-08-26 12:12:45,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4765 conditions, 1017 events. 467/1017 cut-off events. For 2923/2925 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5754 event pairs, 31 based on Foata normal form. 12/1025 useless extension candidates. Maximal degree in co-relation 4744. Up to 449 conditions per place. [2023-08-26 12:12:45,350 INFO L140 encePairwiseOnDemand]: 297/312 looper letters, 74 selfloop transitions, 31 changer transitions 23/129 dead transitions. [2023-08-26 12:12:45,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 129 transitions, 1262 flow [2023-08-26 12:12:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 12:12:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 12:12:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1254 transitions. [2023-08-26 12:12:45,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3091715976331361 [2023-08-26 12:12:45,353 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1254 transitions. [2023-08-26 12:12:45,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1254 transitions. [2023-08-26 12:12:45,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:45,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1254 transitions. [2023-08-26 12:12:45,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.46153846153847) internal successors, (1254), 13 states have internal predecessors, (1254), 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-26 12:12:45,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 312.0) internal successors, (4368), 14 states have internal predecessors, (4368), 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-26 12:12:45,361 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 312.0) internal successors, (4368), 14 states have internal predecessors, (4368), 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-26 12:12:45,361 INFO L175 Difference]: Start difference. First operand has 81 places, 58 transitions, 441 flow. Second operand 13 states and 1254 transitions. [2023-08-26 12:12:45,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 129 transitions, 1262 flow [2023-08-26 12:12:45,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 129 transitions, 1148 flow, removed 46 selfloop flow, removed 4 redundant places. [2023-08-26 12:12:45,370 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 598 flow [2023-08-26 12:12:45,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=598, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2023-08-26 12:12:45,371 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 4 predicate places. [2023-08-26 12:12:45,371 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 598 flow [2023-08-26 12:12:45,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 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-26 12:12:45,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:45,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:45,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:12:45,372 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:45,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash -402019499, now seen corresponding path program 1 times [2023-08-26 12:12:45,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:45,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321306521] [2023-08-26 12:12:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:45,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:12:45,574 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-26 12:12:45,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:12:45,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321306521] [2023-08-26 12:12:45,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321306521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:12:45,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:12:45,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:12:45,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579065665] [2023-08-26 12:12:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:12:45,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:12:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:12:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:12:45,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:12:45,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 312 [2023-08-26 12:12:45,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 71 transitions, 598 flow. Second operand has 6 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 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-26 12:12:45,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:12:45,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 312 [2023-08-26 12:12:45,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:12:45,798 INFO L124 PetriNetUnfolderBase]: 293/597 cut-off events. [2023-08-26 12:12:45,798 INFO L125 PetriNetUnfolderBase]: For 1614/1670 co-relation queries the response was YES. [2023-08-26 12:12:45,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 597 events. 293/597 cut-off events. For 1614/1670 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2925 event pairs, 25 based on Foata normal form. 57/651 useless extension candidates. Maximal degree in co-relation 2644. Up to 234 conditions per place. [2023-08-26 12:12:45,801 INFO L140 encePairwiseOnDemand]: 306/312 looper letters, 46 selfloop transitions, 10 changer transitions 40/102 dead transitions. [2023-08-26 12:12:45,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 102 transitions, 986 flow [2023-08-26 12:12:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:12:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:12:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2023-08-26 12:12:45,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4033882783882784 [2023-08-26 12:12:45,804 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 881 transitions. [2023-08-26 12:12:45,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 881 transitions. [2023-08-26 12:12:45,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:12:45,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 881 transitions. [2023-08-26 12:12:45,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 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-26 12:12:45,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 312.0) internal successors, (2496), 8 states have internal predecessors, (2496), 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-26 12:12:45,810 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 312.0) internal successors, (2496), 8 states have internal predecessors, (2496), 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-26 12:12:45,810 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 598 flow. Second operand 7 states and 881 transitions. [2023-08-26 12:12:45,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 102 transitions, 986 flow [2023-08-26 12:12:45,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 102 transitions, 859 flow, removed 26 selfloop flow, removed 13 redundant places. [2023-08-26 12:12:45,815 INFO L231 Difference]: Finished difference. Result has 74 places, 41 transitions, 292 flow [2023-08-26 12:12:45,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=74, PETRI_TRANSITIONS=41} [2023-08-26 12:12:45,816 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -11 predicate places. [2023-08-26 12:12:45,816 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 41 transitions, 292 flow [2023-08-26 12:12:45,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 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-26 12:12:45,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:12:45,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:45,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:12:45,817 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-08-26 12:12:45,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:12:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1305987262, now seen corresponding path program 1 times [2023-08-26 12:12:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:12:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487346116] [2023-08-26 12:12:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:12:45,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:12:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:12:45,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:12:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:12:46,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:12:46,025 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:12:46,026 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (75 of 76 remaining) [2023-08-26 12:12:46,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 76 remaining) [2023-08-26 12:12:46,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 76 remaining) [2023-08-26 12:12:46,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 76 remaining) [2023-08-26 12:12:46,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 76 remaining) [2023-08-26 12:12:46,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 76 remaining) [2023-08-26 12:12:46,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 76 remaining) [2023-08-26 12:12:46,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 76 remaining) [2023-08-26 12:12:46,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 76 remaining) [2023-08-26 12:12:46,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 76 remaining) [2023-08-26 12:12:46,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 76 remaining) [2023-08-26 12:12:46,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 76 remaining) [2023-08-26 12:12:46,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 76 remaining) [2023-08-26 12:12:46,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 76 remaining) [2023-08-26 12:12:46,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 76 remaining) [2023-08-26 12:12:46,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 76 remaining) [2023-08-26 12:12:46,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 76 remaining) [2023-08-26 12:12:46,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 76 remaining) [2023-08-26 12:12:46,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 76 remaining) [2023-08-26 12:12:46,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 76 remaining) [2023-08-26 12:12:46,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 76 remaining) [2023-08-26 12:12:46,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 76 remaining) [2023-08-26 12:12:46,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 76 remaining) [2023-08-26 12:12:46,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 76 remaining) [2023-08-26 12:12:46,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 76 remaining) [2023-08-26 12:12:46,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 76 remaining) [2023-08-26 12:12:46,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 76 remaining) [2023-08-26 12:12:46,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 76 remaining) [2023-08-26 12:12:46,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 76 remaining) [2023-08-26 12:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 76 remaining) [2023-08-26 12:12:46,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 76 remaining) [2023-08-26 12:12:46,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 76 remaining) [2023-08-26 12:12:46,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 76 remaining) [2023-08-26 12:12:46,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 76 remaining) [2023-08-26 12:12:46,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 76 remaining) [2023-08-26 12:12:46,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 76 remaining) [2023-08-26 12:12:46,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 76 remaining) [2023-08-26 12:12:46,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 76 remaining) [2023-08-26 12:12:46,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 76 remaining) [2023-08-26 12:12:46,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 76 remaining) [2023-08-26 12:12:46,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 76 remaining) [2023-08-26 12:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 76 remaining) [2023-08-26 12:12:46,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 76 remaining) [2023-08-26 12:12:46,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 76 remaining) [2023-08-26 12:12:46,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 76 remaining) [2023-08-26 12:12:46,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:12:46,035 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:12:46,041 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:12:46,041 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:12:46,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:12:46 BasicIcfg [2023-08-26 12:12:46,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:12:46,142 INFO L158 Benchmark]: Toolchain (without parser) took 42812.78ms. Allocated memory was 352.3MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 327.4MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 908.1MB. Max. memory is 16.0GB. [2023-08-26 12:12:46,142 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 352.3MB. Free memory is still 328.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:12:46,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.18ms. Allocated memory is still 352.3MB. Free memory was 326.9MB in the beginning and 302.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:12:46,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.45ms. Allocated memory is still 352.3MB. Free memory was 302.9MB in the beginning and 299.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 12:12:46,143 INFO L158 Benchmark]: Boogie Preprocessor took 31.14ms. Allocated memory is still 352.3MB. Free memory was 299.7MB in the beginning and 297.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:12:46,143 INFO L158 Benchmark]: RCFGBuilder took 1375.56ms. Allocated memory was 352.3MB in the beginning and 436.2MB in the end (delta: 83.9MB). Free memory was 297.6MB in the beginning and 329.0MB in the end (delta: -31.4MB). Peak memory consumption was 54.6MB. Max. memory is 16.0GB. [2023-08-26 12:12:46,143 INFO L158 Benchmark]: TraceAbstraction took 40778.27ms. Allocated memory was 436.2MB in the beginning and 2.6GB in the end (delta: 2.1GB). Free memory was 327.9MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 824.2MB. Max. memory is 16.0GB. [2023-08-26 12:12:46,144 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.13ms. Allocated memory is still 352.3MB. Free memory is still 328.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 569.18ms. Allocated memory is still 352.3MB. Free memory was 326.9MB in the beginning and 302.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.45ms. Allocated memory is still 352.3MB. Free memory was 302.9MB in the beginning and 299.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.14ms. Allocated memory is still 352.3MB. Free memory was 299.7MB in the beginning and 297.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1375.56ms. Allocated memory was 352.3MB in the beginning and 436.2MB in the end (delta: 83.9MB). Free memory was 297.6MB in the beginning and 329.0MB in the end (delta: -31.4MB). Peak memory consumption was 54.6MB. Max. memory is 16.0GB. * TraceAbstraction took 40778.27ms. Allocated memory was 436.2MB in the beginning and 2.6GB in the end (delta: 2.1GB). Free memory was 327.9MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 824.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.6s, 179 PlacesBefore, 85 PlacesAfterwards, 172 TransitionsBefore, 77 TransitionsAfterwards, 6480 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 137 TotalNumberOfCompositions, 39706 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9195, independent: 8398, independent conditional: 0, independent unconditional: 8398, dependent: 797, dependent conditional: 0, dependent unconditional: 797, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2511, independent: 2413, independent conditional: 0, independent unconditional: 2413, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9195, independent: 5985, independent conditional: 0, independent unconditional: 5985, dependent: 699, dependent conditional: 0, dependent unconditional: 699, unknown: 2511, unknown conditional: 0, unknown unconditional: 2511] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 404, Positive conditional cache size: 0, Positive unconditional cache size: 404, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1997; [L835] FCALL, FORK 0 pthread_create(&t1997, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1997, ((void *)0), P0, ((void *)0))=-2, t1997={7:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] EXPR 1 \read(y) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L771] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L772] EXPR 1 \read(y) [L772] 1 __unbuffered_p0_EAX = y [L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L773] 1 y = y$flush_delayed ? y$mem_tmp : y [L774] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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={3:0}] [L836] 0 pthread_t t1998; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1997={7:0}, t1998={8:0}, weak$$choice1=0, weak$$choice2=1, 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={3:0}] [L837] FCALL, FORK 0 pthread_create(&t1998, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1998, ((void *)0), P1, ((void *)0))=-1, t1997={7:0}, t1998={8:0}, weak$$choice1=0, weak$$choice2=1, 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={3:0}] [L838] 0 pthread_t t1999; [L777] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L789] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L792] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 \read(y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L839] FCALL, FORK 0 pthread_create(&t1999, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1999, ((void *)0), P2, ((void *)0))=0, t1997={7:0}, t1998={8:0}, t1999={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L809] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 \read(y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1997={7:0}, t1998={8:0}, t1999={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 y$flush_delayed = weak$$choice2 [L855] EXPR 0 \read(y) [L855] 0 y$mem_tmp = y [L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] EXPR 0 \read(y) [L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L864] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L864] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L864] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L864] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] EXPR 0 \read(y) [L865] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L866] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L866] EXPR 0 \read(y) [L866] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L866] 0 y = y$flush_delayed ? y$mem_tmp : y [L867] 0 y$flush_delayed = (_Bool)0 [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe009_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, 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={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 222 locations, 76 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: 40.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 703 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 703 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1671 IncrementalHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 14 mSDtfsCounter, 1671 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1523occurred in iteration=12, InterpolantAutomatonStates: 87, 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.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 1547 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:12:46,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...