/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 --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -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/safe019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:20:38,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:20:38,371 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 15:20:38,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:20:38,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:20:38,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:20:38,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:20:38,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:20:38,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:20:38,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:20:38,390 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:20:38,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:20:38,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:20:38,391 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:20:38,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:20:38,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:20:38,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:20:38,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:20:38,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:20:38,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:20:38,393 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:20:38,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:20:38,393 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:20:38,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:20:38,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:20:38,394 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:20:38,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:20:38,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:20:38,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:20:38,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:20:38,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:20:38,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:20:38,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:20:38,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:20:38,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:20:38,396 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST 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 15:20:38,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:20:38,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:20:38,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:20:38,672 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:20:38,673 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:20:38,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-08-26 15:20:39,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:20:39,914 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:20:39,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-08-26 15:20:39,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6437dd80/ebf39cb6418745948d9e01824590642a/FLAG861db9aff [2023-08-26 15:20:39,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6437dd80/ebf39cb6418745948d9e01824590642a [2023-08-26 15:20:39,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:20:39,939 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:20:39,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:20:39,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:20:39,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:20:39,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:20:39" (1/1) ... [2023-08-26 15:20:39,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30def19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:39, skipping insertion in model container [2023-08-26 15:20:39,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:20:39" (1/1) ... [2023-08-26 15:20:39,974 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:20:40,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:20:40,211 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:20:40,242 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:20:40,244 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:20:40,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:20:40,324 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:20:40,324 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:20:40,329 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:20:40,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40 WrapperNode [2023-08-26 15:20:40,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:20:40,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:20:40,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:20:40,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:20:40,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,397 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 188 [2023-08-26 15:20:40,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:20:40,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:20:40,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:20:40,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:20:40,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:20:40,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:20:40,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:20:40,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:20:40,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (1/1) ... [2023-08-26 15:20:40,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:20:40,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:20:40,459 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 15:20:40,465 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 15:20:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 15:20:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:20:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:20:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:20:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:20:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:20:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:20:40,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:20:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:20:40,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:20:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:20:40,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:20:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 15:20:40,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 15:20:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:20:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:20:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:20:40,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:20:40,515 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 15:20:40,624 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:20:40,625 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:20:41,011 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:20:41,596 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:20:41,596 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:20:41,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:20:41 BoogieIcfgContainer [2023-08-26 15:20:41,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:20:41,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:20:41,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:20:41,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:20:41,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:20:39" (1/3) ... [2023-08-26 15:20:41,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25215e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:20:41, skipping insertion in model container [2023-08-26 15:20:41,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:20:40" (2/3) ... [2023-08-26 15:20:41,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25215e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:20:41, skipping insertion in model container [2023-08-26 15:20:41,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:20:41" (3/3) ... [2023-08-26 15:20:41,606 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2023-08-26 15:20:41,618 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:20:41,618 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2023-08-26 15:20:41,618 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:20:41,732 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:20:41,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 201 transitions, 422 flow [2023-08-26 15:20:41,831 INFO L124 PetriNetUnfolderBase]: 3/197 cut-off events. [2023-08-26 15:20:41,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:20:41,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 197 events. 3/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 331 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2023-08-26 15:20:41,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 201 transitions, 422 flow [2023-08-26 15:20:41,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 197 transitions, 406 flow [2023-08-26 15:20:41,844 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:20:41,850 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 197 transitions, 406 flow [2023-08-26 15:20:41,852 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 197 transitions, 406 flow [2023-08-26 15:20:41,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 197 transitions, 406 flow [2023-08-26 15:20:41,882 INFO L124 PetriNetUnfolderBase]: 3/197 cut-off events. [2023-08-26 15:20:41,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:20:41,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 197 events. 3/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 327 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2023-08-26 15:20:41,887 INFO L119 LiptonReduction]: Number of co-enabled transitions 8996 [2023-08-26 15:20:54,247 INFO L134 LiptonReduction]: Checked pairs total: 43421 [2023-08-26 15:20:54,247 INFO L136 LiptonReduction]: Total number of compositions: 163 [2023-08-26 15:20:54,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:20:54,261 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;@18313a1d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:20:54,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2023-08-26 15:20:54,262 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:20:54,262 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:20:54,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:20:54,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:54,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:20:54,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:54,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1247, now seen corresponding path program 1 times [2023-08-26 15:20:54,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:54,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718663393] [2023-08-26 15:20:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:54,359 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 15:20:54,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718663393] [2023-08-26 15:20:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718663393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:54,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:20:54,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559731632] [2023-08-26 15:20:54,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:54,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:20:54,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:54,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:20:54,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:20:54,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 364 [2023-08-26 15:20:54,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 89 transitions, 190 flow. Second operand has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 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 15:20:54,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:54,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 364 [2023-08-26 15:20:54,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:03,493 INFO L124 PetriNetUnfolderBase]: 61940/82847 cut-off events. [2023-08-26 15:21:03,493 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-26 15:21:03,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164681 conditions, 82847 events. 61940/82847 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6072. Compared 558800 event pairs, 61940 based on Foata normal form. 0/42824 useless extension candidates. Maximal degree in co-relation 164669. Up to 81547 conditions per place. [2023-08-26 15:21:04,001 INFO L140 encePairwiseOnDemand]: 330/364 looper letters, 47 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2023-08-26 15:21:04,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 53 transitions, 212 flow [2023-08-26 15:21:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:21:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:21:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 373 transitions. [2023-08-26 15:21:04,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123626373626373 [2023-08-26 15:21:04,012 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 373 transitions. [2023-08-26 15:21:04,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 373 transitions. [2023-08-26 15:21:04,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:04,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 373 transitions. [2023-08-26 15:21:04,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 186.5) internal successors, (373), 2 states have internal predecessors, (373), 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 15:21:04,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 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 15:21:04,021 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 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 15:21:04,022 INFO L175 Difference]: Start difference. First operand has 100 places, 89 transitions, 190 flow. Second operand 2 states and 373 transitions. [2023-08-26 15:21:04,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 53 transitions, 212 flow [2023-08-26 15:21:04,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 15:21:04,033 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 114 flow [2023-08-26 15:21:04,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-08-26 15:21:04,037 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2023-08-26 15:21:04,037 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 114 flow [2023-08-26 15:21:04,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 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 15:21:04,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:04,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:21:04,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:21:04,038 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:04,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1231037, now seen corresponding path program 1 times [2023-08-26 15:21:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:04,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376701723] [2023-08-26 15:21:04,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:04,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:04,244 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 15:21:04,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:04,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376701723] [2023-08-26 15:21:04,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376701723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:04,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:04,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:21:04,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874270423] [2023-08-26 15:21:04,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:04,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:21:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:21:04,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:21:04,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 364 [2023-08-26 15:21:04,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 15:21:04,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:04,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 364 [2023-08-26 15:21:04,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:11,865 INFO L124 PetriNetUnfolderBase]: 54579/74117 cut-off events. [2023-08-26 15:21:11,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:21:12,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148102 conditions, 74117 events. 54579/74117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3340. Compared 471718 event pairs, 34675 based on Foata normal form. 0/48268 useless extension candidates. Maximal degree in co-relation 148099. Up to 46214 conditions per place. [2023-08-26 15:21:12,380 INFO L140 encePairwiseOnDemand]: 344/364 looper letters, 60 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2023-08-26 15:21:12,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 290 flow [2023-08-26 15:21:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:21:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:21:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-26 15:21:12,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2023-08-26 15:21:12,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-26 15:21:12,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-26 15:21:12,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:12,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-26 15:21:12,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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 15:21:12,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:12,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:12,393 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 114 flow. Second operand 3 states and 434 transitions. [2023-08-26 15:21:12,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 290 flow [2023-08-26 15:21:12,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:21:12,396 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 194 flow [2023-08-26 15:21:12,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-08-26 15:21:12,397 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2023-08-26 15:21:12,397 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 194 flow [2023-08-26 15:21:12,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 15:21:12,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:12,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:21:12,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:21:12,401 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:12,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1231038, now seen corresponding path program 1 times [2023-08-26 15:21:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:12,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617042950] [2023-08-26 15:21:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:12,504 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 15:21:12,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617042950] [2023-08-26 15:21:12,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617042950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:12,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:21:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742417648] [2023-08-26 15:21:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:12,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:21:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:12,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:21:12,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:21:12,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 364 [2023-08-26 15:21:12,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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 15:21:12,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:12,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 364 [2023-08-26 15:21:12,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:15,357 INFO L124 PetriNetUnfolderBase]: 15400/21969 cut-off events. [2023-08-26 15:21:15,357 INFO L125 PetriNetUnfolderBase]: For 5885/5885 co-relation queries the response was YES. [2023-08-26 15:21:15,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58457 conditions, 21969 events. 15400/21969 cut-off events. For 5885/5885 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 134990 event pairs, 12292 based on Foata normal form. 5178/25886 useless extension candidates. Maximal degree in co-relation 58452. Up to 20708 conditions per place. [2023-08-26 15:21:15,430 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 44 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-08-26 15:21:15,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 264 flow [2023-08-26 15:21:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:21:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:21:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-26 15:21:15,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38186813186813184 [2023-08-26 15:21:15,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-26 15:21:15,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-26 15:21:15,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:15,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-26 15:21:15,433 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 15:21:15,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:15,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:15,435 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 194 flow. Second operand 3 states and 417 transitions. [2023-08-26 15:21:15,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 264 flow [2023-08-26 15:21:15,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:21:15,471 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 156 flow [2023-08-26 15:21:15,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-08-26 15:21:15,472 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -46 predicate places. [2023-08-26 15:21:15,472 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 156 flow [2023-08-26 15:21:15,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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 15:21:15,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:15,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:15,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:21:15,475 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:15,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash 161143649, now seen corresponding path program 1 times [2023-08-26 15:21:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:15,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960563639] [2023-08-26 15:21:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:15,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:15,602 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 15:21:15,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:15,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960563639] [2023-08-26 15:21:15,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960563639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:15,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:15,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:21:15,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838955813] [2023-08-26 15:21:15,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:15,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:21:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:15,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:21:15,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:21:15,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 364 [2023-08-26 15:21:15,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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 15:21:15,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:15,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 364 [2023-08-26 15:21:15,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:17,743 INFO L124 PetriNetUnfolderBase]: 14493/20943 cut-off events. [2023-08-26 15:21:17,743 INFO L125 PetriNetUnfolderBase]: For 2627/2786 co-relation queries the response was YES. [2023-08-26 15:21:17,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51526 conditions, 20943 events. 14493/20943 cut-off events. For 2627/2786 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 132447 event pairs, 8210 based on Foata normal form. 0/17501 useless extension candidates. Maximal degree in co-relation 51521. Up to 11924 conditions per place. [2023-08-26 15:21:17,850 INFO L140 encePairwiseOnDemand]: 360/364 looper letters, 71 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-08-26 15:21:17,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 408 flow [2023-08-26 15:21:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:21:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:21:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2023-08-26 15:21:17,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45787545787545786 [2023-08-26 15:21:17,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2023-08-26 15:21:17,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2023-08-26 15:21:17,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:17,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2023-08-26 15:21:17,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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 15:21:17,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:17,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:17,855 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 156 flow. Second operand 3 states and 500 transitions. [2023-08-26 15:21:17,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 408 flow [2023-08-26 15:21:17,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:21:17,858 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 168 flow [2023-08-26 15:21:17,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-26 15:21:17,860 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -44 predicate places. [2023-08-26 15:21:17,860 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 168 flow [2023-08-26 15:21:17,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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 15:21:17,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:17,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:17,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:21:17,861 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:17,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash 161143883, now seen corresponding path program 1 times [2023-08-26 15:21:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551600243] [2023-08-26 15:21:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:18,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 15:21:18,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:18,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551600243] [2023-08-26 15:21:18,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551600243] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:18,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:18,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:21:18,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869789316] [2023-08-26 15:21:18,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:18,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:21:18,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:18,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:21:18,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:21:18,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 364 [2023-08-26 15:21:18,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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 15:21:18,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:18,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 364 [2023-08-26 15:21:18,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:20,125 INFO L124 PetriNetUnfolderBase]: 13701/20027 cut-off events. [2023-08-26 15:21:20,126 INFO L125 PetriNetUnfolderBase]: For 5356/5392 co-relation queries the response was YES. [2023-08-26 15:21:20,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52604 conditions, 20027 events. 13701/20027 cut-off events. For 5356/5392 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 131851 event pairs, 3093 based on Foata normal form. 0/17620 useless extension candidates. Maximal degree in co-relation 52598. Up to 15673 conditions per place. [2023-08-26 15:21:20,226 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 66 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-08-26 15:21:20,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 400 flow [2023-08-26 15:21:20,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:21:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:21:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2023-08-26 15:21:20,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2023-08-26 15:21:20,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2023-08-26 15:21:20,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2023-08-26 15:21:20,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:20,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2023-08-26 15:21:20,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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 15:21:20,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:20,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:20,245 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 168 flow. Second operand 3 states and 490 transitions. [2023-08-26 15:21:20,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 400 flow [2023-08-26 15:21:20,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:21:20,250 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 170 flow [2023-08-26 15:21:20,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-08-26 15:21:20,252 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -43 predicate places. [2023-08-26 15:21:20,252 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 170 flow [2023-08-26 15:21:20,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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 15:21:20,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:20,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:20,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:21:20,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:20,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:20,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1070192562, now seen corresponding path program 1 times [2023-08-26 15:21:20,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:20,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362213381] [2023-08-26 15:21:20,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:20,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:20,527 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 15:21:20,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:20,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362213381] [2023-08-26 15:21:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362213381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:20,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:21:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933341944] [2023-08-26 15:21:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:20,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:21:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:20,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:21:20,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:21:20,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 364 [2023-08-26 15:21:20,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 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 15:21:20,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:20,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 364 [2023-08-26 15:21:20,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:23,012 INFO L124 PetriNetUnfolderBase]: 14262/21211 cut-off events. [2023-08-26 15:21:23,012 INFO L125 PetriNetUnfolderBase]: For 3026/3026 co-relation queries the response was YES. [2023-08-26 15:21:23,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54959 conditions, 21211 events. 14262/21211 cut-off events. For 3026/3026 co-relation queries the response was YES. Maximal size of possible extension queue 1166. Compared 140745 event pairs, 5794 based on Foata normal form. 120/18499 useless extension candidates. Maximal degree in co-relation 54952. Up to 11738 conditions per place. [2023-08-26 15:21:23,078 INFO L140 encePairwiseOnDemand]: 360/364 looper letters, 77 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2023-08-26 15:21:23,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 445 flow [2023-08-26 15:21:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:21:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:21:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-08-26 15:21:23,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38255494505494503 [2023-08-26 15:21:23,080 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-08-26 15:21:23,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-08-26 15:21:23,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:23,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-08-26 15:21:23,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 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 15:21:23,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:23,083 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:23,083 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 170 flow. Second operand 4 states and 557 transitions. [2023-08-26 15:21:23,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 445 flow [2023-08-26 15:21:23,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 436 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:21:23,085 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 161 flow [2023-08-26 15:21:23,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-26 15:21:23,086 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -45 predicate places. [2023-08-26 15:21:23,086 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 161 flow [2023-08-26 15:21:23,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 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 15:21:23,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:23,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:23,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:21:23,087 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:23,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:23,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1924836693, now seen corresponding path program 1 times [2023-08-26 15:21:23,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:23,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976843813] [2023-08-26 15:21:23,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:23,227 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 15:21:23,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976843813] [2023-08-26 15:21:23,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976843813] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:23,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:23,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:21:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519931330] [2023-08-26 15:21:23,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:23,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:21:23,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:21:23,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:21:23,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 364 [2023-08-26 15:21:23,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 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 15:21:23,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:23,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 364 [2023-08-26 15:21:23,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:27,043 INFO L124 PetriNetUnfolderBase]: 26281/37781 cut-off events. [2023-08-26 15:21:27,043 INFO L125 PetriNetUnfolderBase]: For 13433/13943 co-relation queries the response was YES. [2023-08-26 15:21:27,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97897 conditions, 37781 events. 26281/37781 cut-off events. For 13433/13943 co-relation queries the response was YES. Maximal size of possible extension queue 2125. Compared 262434 event pairs, 4854 based on Foata normal form. 279/33299 useless extension candidates. Maximal degree in co-relation 97891. Up to 16817 conditions per place. [2023-08-26 15:21:27,305 INFO L140 encePairwiseOnDemand]: 360/364 looper letters, 99 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2023-08-26 15:21:27,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 108 transitions, 580 flow [2023-08-26 15:21:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:21:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:21:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 650 transitions. [2023-08-26 15:21:27,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2023-08-26 15:21:27,307 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 650 transitions. [2023-08-26 15:21:27,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 650 transitions. [2023-08-26 15:21:27,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:27,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 650 transitions. [2023-08-26 15:21:27,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.5) internal successors, (650), 4 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 15:21:27,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:27,310 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:27,310 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 161 flow. Second operand 4 states and 650 transitions. [2023-08-26 15:21:27,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 108 transitions, 580 flow [2023-08-26 15:21:27,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:21:27,314 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 176 flow [2023-08-26 15:21:27,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-08-26 15:21:27,314 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -42 predicate places. [2023-08-26 15:21:27,314 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 176 flow [2023-08-26 15:21:27,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 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 15:21:27,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:27,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:27,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:21:27,315 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:27,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash 240412558, now seen corresponding path program 1 times [2023-08-26 15:21:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497391685] [2023-08-26 15:21:27,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:27,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:27,495 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 15:21:27,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497391685] [2023-08-26 15:21:27,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497391685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:27,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:27,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:21:27,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095587998] [2023-08-26 15:21:27,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:27,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:21:27,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:27,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:21:27,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:21:27,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 364 [2023-08-26 15:21:27,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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 15:21:27,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:27,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 364 [2023-08-26 15:21:27,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:30,704 INFO L124 PetriNetUnfolderBase]: 20567/31073 cut-off events. [2023-08-26 15:21:30,705 INFO L125 PetriNetUnfolderBase]: For 10008/10214 co-relation queries the response was YES. [2023-08-26 15:21:30,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83570 conditions, 31073 events. 20567/31073 cut-off events. For 10008/10214 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 228462 event pairs, 8523 based on Foata normal form. 30/26294 useless extension candidates. Maximal degree in co-relation 83562. Up to 16367 conditions per place. [2023-08-26 15:21:30,863 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 70 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2023-08-26 15:21:30,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 437 flow [2023-08-26 15:21:30,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:21:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:21:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-08-26 15:21:30,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45146520146520147 [2023-08-26 15:21:30,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-08-26 15:21:30,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-08-26 15:21:30,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:30,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-08-26 15:21:30,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:21:30,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:30,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:30,895 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 176 flow. Second operand 3 states and 493 transitions. [2023-08-26 15:21:30,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 437 flow [2023-08-26 15:21:30,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:21:30,899 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 183 flow [2023-08-26 15:21:30,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-26 15:21:30,900 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2023-08-26 15:21:30,901 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 183 flow [2023-08-26 15:21:30,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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 15:21:30,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:30,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:30,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:21:30,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:30,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:30,901 INFO L85 PathProgramCache]: Analyzing trace with hash 240441298, now seen corresponding path program 1 times [2023-08-26 15:21:30,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:30,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69827388] [2023-08-26 15:21:30,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:31,084 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 15:21:31,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:31,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69827388] [2023-08-26 15:21:31,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69827388] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:31,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:31,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:21:31,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345762092] [2023-08-26 15:21:31,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:31,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:21:31,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:31,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:21:31,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:21:31,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 364 [2023-08-26 15:21:31,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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 15:21:31,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:31,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 364 [2023-08-26 15:21:31,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:33,728 INFO L124 PetriNetUnfolderBase]: 18606/26680 cut-off events. [2023-08-26 15:21:33,729 INFO L125 PetriNetUnfolderBase]: For 7833/7833 co-relation queries the response was YES. [2023-08-26 15:21:33,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78971 conditions, 26680 events. 18606/26680 cut-off events. For 7833/7833 co-relation queries the response was YES. Maximal size of possible extension queue 1609. Compared 170776 event pairs, 6091 based on Foata normal form. 92/24143 useless extension candidates. Maximal degree in co-relation 78962. Up to 11717 conditions per place. [2023-08-26 15:21:33,864 INFO L140 encePairwiseOnDemand]: 347/364 looper letters, 59 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2023-08-26 15:21:33,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 417 flow [2023-08-26 15:21:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:21:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:21:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-26 15:21:33,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3626373626373626 [2023-08-26 15:21:33,866 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-26 15:21:33,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-26 15:21:33,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:33,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-26 15:21:33,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 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 15:21:33,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:33,869 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:33,869 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 183 flow. Second operand 4 states and 528 transitions. [2023-08-26 15:21:33,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 417 flow [2023-08-26 15:21:33,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:21:33,873 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 265 flow [2023-08-26 15:21:33,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-08-26 15:21:33,873 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2023-08-26 15:21:33,873 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 265 flow [2023-08-26 15:21:33,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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 15:21:33,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:33,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:33,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:21:33,874 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:33,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:33,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2070243421, now seen corresponding path program 1 times [2023-08-26 15:21:33,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:33,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356978755] [2023-08-26 15:21:33,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:33,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:34,939 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 15:21:34,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:34,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356978755] [2023-08-26 15:21:34,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356978755] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:34,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:34,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:21:34,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684309633] [2023-08-26 15:21:34,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:34,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:21:34,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:34,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:21:34,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:21:34,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 364 [2023-08-26 15:21:34,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 265 flow. Second operand has 9 states, 9 states have (on average 107.88888888888889) internal successors, (971), 9 states have internal predecessors, (971), 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 15:21:34,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:34,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 364 [2023-08-26 15:21:34,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:37,993 INFO L124 PetriNetUnfolderBase]: 18708/26845 cut-off events. [2023-08-26 15:21:37,993 INFO L125 PetriNetUnfolderBase]: For 17464/17464 co-relation queries the response was YES. [2023-08-26 15:21:38,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91395 conditions, 26845 events. 18708/26845 cut-off events. For 17464/17464 co-relation queries the response was YES. Maximal size of possible extension queue 1614. Compared 174083 event pairs, 4305 based on Foata normal form. 76/26045 useless extension candidates. Maximal degree in co-relation 91385. Up to 24523 conditions per place. [2023-08-26 15:21:38,121 INFO L140 encePairwiseOnDemand]: 351/364 looper letters, 112 selfloop transitions, 35 changer transitions 0/148 dead transitions. [2023-08-26 15:21:38,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 148 transitions, 1031 flow [2023-08-26 15:21:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 15:21:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 15:21:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1394 transitions. [2023-08-26 15:21:38,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3191391941391941 [2023-08-26 15:21:38,124 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1394 transitions. [2023-08-26 15:21:38,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1394 transitions. [2023-08-26 15:21:38,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:38,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1394 transitions. [2023-08-26 15:21:38,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.16666666666667) internal successors, (1394), 12 states have internal predecessors, (1394), 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 15:21:38,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 364.0) internal successors, (4732), 13 states have internal predecessors, (4732), 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 15:21:38,131 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 364.0) internal successors, (4732), 13 states have internal predecessors, (4732), 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 15:21:38,131 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 265 flow. Second operand 12 states and 1394 transitions. [2023-08-26 15:21:38,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 148 transitions, 1031 flow [2023-08-26 15:21:38,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 148 transitions, 1028 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:21:38,198 INFO L231 Difference]: Finished difference. Result has 79 places, 84 transitions, 613 flow [2023-08-26 15:21:38,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=613, PETRI_PLACES=79, PETRI_TRANSITIONS=84} [2023-08-26 15:21:38,199 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -21 predicate places. [2023-08-26 15:21:38,199 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 84 transitions, 613 flow [2023-08-26 15:21:38,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.88888888888889) internal successors, (971), 9 states have internal predecessors, (971), 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 15:21:38,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:38,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:38,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:21:38,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:38,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1136258202, now seen corresponding path program 1 times [2023-08-26 15:21:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:38,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132694440] [2023-08-26 15:21:38,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:38,351 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 15:21:38,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:38,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132694440] [2023-08-26 15:21:38,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132694440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:38,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:38,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:21:38,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055911540] [2023-08-26 15:21:38,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:38,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:21:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:38,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:21:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:21:38,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 364 [2023-08-26 15:21:38,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 613 flow. Second operand has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 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 15:21:38,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:38,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 364 [2023-08-26 15:21:38,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:40,782 INFO L124 PetriNetUnfolderBase]: 15129/21782 cut-off events. [2023-08-26 15:21:40,782 INFO L125 PetriNetUnfolderBase]: For 23607/23607 co-relation queries the response was YES. [2023-08-26 15:21:40,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81189 conditions, 21782 events. 15129/21782 cut-off events. For 23607/23607 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 135825 event pairs, 4259 based on Foata normal form. 350/21548 useless extension candidates. Maximal degree in co-relation 81171. Up to 7431 conditions per place. [2023-08-26 15:21:40,931 INFO L140 encePairwiseOnDemand]: 347/364 looper letters, 97 selfloop transitions, 24 changer transitions 0/122 dead transitions. [2023-08-26 15:21:40,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 1032 flow [2023-08-26 15:21:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:21:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:21:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2023-08-26 15:21:40,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34706959706959706 [2023-08-26 15:21:40,933 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 758 transitions. [2023-08-26 15:21:40,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions. [2023-08-26 15:21:40,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:40,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions. [2023-08-26 15:21:40,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 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 15:21:40,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 364.0) internal successors, (2548), 7 states have internal predecessors, (2548), 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 15:21:40,936 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 364.0) internal successors, (2548), 7 states have internal predecessors, (2548), 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 15:21:40,936 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 613 flow. Second operand 6 states and 758 transitions. [2023-08-26 15:21:40,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 1032 flow [2023-08-26 15:21:41,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 122 transitions, 1024 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 15:21:41,524 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 753 flow [2023-08-26 15:21:41,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=753, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2023-08-26 15:21:41,524 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -16 predicate places. [2023-08-26 15:21:41,524 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 753 flow [2023-08-26 15:21:41,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 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 15:21:41,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:41,525 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 15:21:41,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:21:41,525 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:41,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash -636884181, now seen corresponding path program 1 times [2023-08-26 15:21:41,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:41,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013314534] [2023-08-26 15:21:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:41,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:42,003 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 15:21:42,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:42,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013314534] [2023-08-26 15:21:42,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013314534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:42,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:42,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:21:42,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438260732] [2023-08-26 15:21:42,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:42,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:21:42,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:42,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:21:42,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:21:42,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 364 [2023-08-26 15:21:42,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 89 transitions, 753 flow. Second operand has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 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 15:21:42,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:42,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 364 [2023-08-26 15:21:42,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:45,085 INFO L124 PetriNetUnfolderBase]: 18722/26985 cut-off events. [2023-08-26 15:21:45,085 INFO L125 PetriNetUnfolderBase]: For 48223/48244 co-relation queries the response was YES. [2023-08-26 15:21:45,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112116 conditions, 26985 events. 18722/26985 cut-off events. For 48223/48244 co-relation queries the response was YES. Maximal size of possible extension queue 1599. Compared 175105 event pairs, 10900 based on Foata normal form. 37/26037 useless extension candidates. Maximal degree in co-relation 112096. Up to 21377 conditions per place. [2023-08-26 15:21:45,305 INFO L140 encePairwiseOnDemand]: 356/364 looper letters, 90 selfloop transitions, 33 changer transitions 0/126 dead transitions. [2023-08-26 15:21:45,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 126 transitions, 1278 flow [2023-08-26 15:21:45,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:21:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:21:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 580 transitions. [2023-08-26 15:21:45,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983516483516483 [2023-08-26 15:21:45,307 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 580 transitions. [2023-08-26 15:21:45,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 580 transitions. [2023-08-26 15:21:45,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:45,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 580 transitions. [2023-08-26 15:21:45,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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 15:21:45,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:45,310 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:45,310 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 753 flow. Second operand 4 states and 580 transitions. [2023-08-26 15:21:45,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 126 transitions, 1278 flow [2023-08-26 15:21:46,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 126 transitions, 1256 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 15:21:46,086 INFO L231 Difference]: Finished difference. Result has 85 places, 106 transitions, 1019 flow [2023-08-26 15:21:46,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1019, PETRI_PLACES=85, PETRI_TRANSITIONS=106} [2023-08-26 15:21:46,086 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -15 predicate places. [2023-08-26 15:21:46,086 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 106 transitions, 1019 flow [2023-08-26 15:21:46,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 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 15:21:46,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:46,086 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 15:21:46,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:21:46,087 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:46,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash -250715739, now seen corresponding path program 1 times [2023-08-26 15:21:46,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:46,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096646447] [2023-08-26 15:21:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:46,237 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 15:21:46,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:46,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096646447] [2023-08-26 15:21:46,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096646447] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:46,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:46,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:21:46,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549191812] [2023-08-26 15:21:46,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:46,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:21:46,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:46,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:21:46,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:21:46,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 364 [2023-08-26 15:21:46,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 106 transitions, 1019 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:21:46,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:46,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 364 [2023-08-26 15:21:46,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:48,368 INFO L124 PetriNetUnfolderBase]: 10262/15737 cut-off events. [2023-08-26 15:21:48,369 INFO L125 PetriNetUnfolderBase]: For 37276/38172 co-relation queries the response was YES. [2023-08-26 15:21:48,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71082 conditions, 15737 events. 10262/15737 cut-off events. For 37276/38172 co-relation queries the response was YES. Maximal size of possible extension queue 1060. Compared 106442 event pairs, 2990 based on Foata normal form. 300/15402 useless extension candidates. Maximal degree in co-relation 71060. Up to 14176 conditions per place. [2023-08-26 15:21:48,446 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 107 selfloop transitions, 5 changer transitions 0/132 dead transitions. [2023-08-26 15:21:48,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 132 transitions, 1372 flow [2023-08-26 15:21:48,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:21:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:21:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-26 15:21:48,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43223443223443225 [2023-08-26 15:21:48,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-26 15:21:48,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-26 15:21:48,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:48,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-26 15:21:48,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:21:48,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:48,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 15:21:48,463 INFO L175 Difference]: Start difference. First operand has 85 places, 106 transitions, 1019 flow. Second operand 3 states and 472 transitions. [2023-08-26 15:21:48,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 132 transitions, 1372 flow [2023-08-26 15:21:48,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 132 transitions, 1329 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 15:21:48,675 INFO L231 Difference]: Finished difference. Result has 86 places, 110 transitions, 1014 flow [2023-08-26 15:21:48,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1014, PETRI_PLACES=86, PETRI_TRANSITIONS=110} [2023-08-26 15:21:48,676 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -14 predicate places. [2023-08-26 15:21:48,676 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 110 transitions, 1014 flow [2023-08-26 15:21:48,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:21:48,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:48,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:48,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:21:48,676 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:48,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:48,677 INFO L85 PathProgramCache]: Analyzing trace with hash -782556457, now seen corresponding path program 1 times [2023-08-26 15:21:48,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:48,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591697293] [2023-08-26 15:21:48,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:49,089 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 15:21:49,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:49,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591697293] [2023-08-26 15:21:49,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591697293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:49,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:49,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:21:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021162978] [2023-08-26 15:21:49,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:49,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:21:49,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:49,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:21:49,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:21:49,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 364 [2023-08-26 15:21:49,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 110 transitions, 1014 flow. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 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 15:21:49,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:49,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 364 [2023-08-26 15:21:49,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:49,836 INFO L124 PetriNetUnfolderBase]: 3286/5498 cut-off events. [2023-08-26 15:21:49,836 INFO L125 PetriNetUnfolderBase]: For 11908/12359 co-relation queries the response was YES. [2023-08-26 15:21:49,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24702 conditions, 5498 events. 3286/5498 cut-off events. For 11908/12359 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 34797 event pairs, 649 based on Foata normal form. 239/5564 useless extension candidates. Maximal degree in co-relation 24679. Up to 4031 conditions per place. [2023-08-26 15:21:49,862 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 114 selfloop transitions, 9 changer transitions 0/138 dead transitions. [2023-08-26 15:21:49,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 138 transitions, 1302 flow [2023-08-26 15:21:49,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:21:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:21:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 627 transitions. [2023-08-26 15:21:49,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43063186813186816 [2023-08-26 15:21:49,864 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 627 transitions. [2023-08-26 15:21:49,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 627 transitions. [2023-08-26 15:21:49,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:49,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 627 transitions. [2023-08-26 15:21:49,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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 15:21:49,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:49,867 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:49,867 INFO L175 Difference]: Start difference. First operand has 86 places, 110 transitions, 1014 flow. Second operand 4 states and 627 transitions. [2023-08-26 15:21:49,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 138 transitions, 1302 flow [2023-08-26 15:21:49,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 138 transitions, 1289 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 15:21:49,898 INFO L231 Difference]: Finished difference. Result has 83 places, 97 transitions, 855 flow [2023-08-26 15:21:49,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=855, PETRI_PLACES=83, PETRI_TRANSITIONS=97} [2023-08-26 15:21:49,898 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -17 predicate places. [2023-08-26 15:21:49,898 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 97 transitions, 855 flow [2023-08-26 15:21:49,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 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 15:21:49,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:49,898 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 15:21:49,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:21:49,899 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:49,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:49,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1972144165, now seen corresponding path program 1 times [2023-08-26 15:21:49,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:49,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490874121] [2023-08-26 15:21:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:49,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:50,023 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 15:21:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:50,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490874121] [2023-08-26 15:21:50,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490874121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:50,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:50,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:21:50,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768141622] [2023-08-26 15:21:50,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:50,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:21:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:50,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:21:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:21:50,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 364 [2023-08-26 15:21:50,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 97 transitions, 855 flow. Second operand has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 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 15:21:50,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:50,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 364 [2023-08-26 15:21:50,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:51,175 INFO L124 PetriNetUnfolderBase]: 6025/10013 cut-off events. [2023-08-26 15:21:51,175 INFO L125 PetriNetUnfolderBase]: For 25274/26024 co-relation queries the response was YES. [2023-08-26 15:21:51,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45656 conditions, 10013 events. 6025/10013 cut-off events. For 25274/26024 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 68598 event pairs, 1279 based on Foata normal form. 242/9944 useless extension candidates. Maximal degree in co-relation 45635. Up to 5189 conditions per place. [2023-08-26 15:21:51,229 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 186 selfloop transitions, 2 changer transitions 15/217 dead transitions. [2023-08-26 15:21:51,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 217 transitions, 2245 flow [2023-08-26 15:21:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:21:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:21:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2023-08-26 15:21:51,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44574175824175827 [2023-08-26 15:21:51,231 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 649 transitions. [2023-08-26 15:21:51,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 649 transitions. [2023-08-26 15:21:51,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:51,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 649 transitions. [2023-08-26 15:21:51,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.25) internal successors, (649), 4 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 15:21:51,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:51,234 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:51,234 INFO L175 Difference]: Start difference. First operand has 83 places, 97 transitions, 855 flow. Second operand 4 states and 649 transitions. [2023-08-26 15:21:51,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 217 transitions, 2245 flow [2023-08-26 15:21:51,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 217 transitions, 2199 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 15:21:51,286 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 850 flow [2023-08-26 15:21:51,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=850, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2023-08-26 15:21:51,286 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -14 predicate places. [2023-08-26 15:21:51,286 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 850 flow [2023-08-26 15:21:51,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 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 15:21:51,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:51,287 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 15:21:51,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:21:51,287 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:51,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash 617033019, now seen corresponding path program 2 times [2023-08-26 15:21:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:51,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846829244] [2023-08-26 15:21:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:51,431 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 15:21:51,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846829244] [2023-08-26 15:21:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846829244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:51,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:21:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009073122] [2023-08-26 15:21:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:51,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:21:51,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:21:51,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:21:51,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 364 [2023-08-26 15:21:51,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 850 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 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 15:21:51,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:51,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 364 [2023-08-26 15:21:51,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:51,877 INFO L124 PetriNetUnfolderBase]: 1868/3168 cut-off events. [2023-08-26 15:21:51,877 INFO L125 PetriNetUnfolderBase]: For 6680/7132 co-relation queries the response was YES. [2023-08-26 15:21:51,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13229 conditions, 3168 events. 1868/3168 cut-off events. For 6680/7132 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18225 event pairs, 234 based on Foata normal form. 271/3354 useless extension candidates. Maximal degree in co-relation 13206. Up to 1043 conditions per place. [2023-08-26 15:21:51,890 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 95 selfloop transitions, 13 changer transitions 13/133 dead transitions. [2023-08-26 15:21:51,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 133 transitions, 1161 flow [2023-08-26 15:21:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:21:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:21:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 780 transitions. [2023-08-26 15:21:51,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-08-26 15:21:51,892 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 780 transitions. [2023-08-26 15:21:51,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 780 transitions. [2023-08-26 15:21:51,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:51,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 780 transitions. [2023-08-26 15:21:51,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 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 15:21:51,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 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 15:21:51,896 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 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 15:21:51,896 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 850 flow. Second operand 5 states and 780 transitions. [2023-08-26 15:21:51,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 133 transitions, 1161 flow [2023-08-26 15:21:51,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 133 transitions, 1124 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-26 15:21:51,905 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 506 flow [2023-08-26 15:21:51,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=506, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2023-08-26 15:21:51,905 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -16 predicate places. [2023-08-26 15:21:51,906 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 506 flow [2023-08-26 15:21:51,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 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 15:21:51,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:51,906 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, 1, 1] [2023-08-26 15:21:51,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:21:51,906 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:51,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash -842467435, now seen corresponding path program 1 times [2023-08-26 15:21:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:51,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591537159] [2023-08-26 15:21:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:52,553 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 15:21:52,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:52,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591537159] [2023-08-26 15:21:52,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591537159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:52,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:52,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:21:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422186474] [2023-08-26 15:21:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:52,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:21:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:52,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:21:52,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:21:52,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 364 [2023-08-26 15:21:52,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 506 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 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 15:21:52,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:52,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 364 [2023-08-26 15:21:52,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:53,101 INFO L124 PetriNetUnfolderBase]: 2602/4552 cut-off events. [2023-08-26 15:21:53,102 INFO L125 PetriNetUnfolderBase]: For 11943/11957 co-relation queries the response was YES. [2023-08-26 15:21:53,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20450 conditions, 4552 events. 2602/4552 cut-off events. For 11943/11957 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 28324 event pairs, 778 based on Foata normal form. 11/4488 useless extension candidates. Maximal degree in co-relation 20429. Up to 2807 conditions per place. [2023-08-26 15:21:53,123 INFO L140 encePairwiseOnDemand]: 356/364 looper letters, 83 selfloop transitions, 18 changer transitions 3/108 dead transitions. [2023-08-26 15:21:53,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 108 transitions, 1000 flow [2023-08-26 15:21:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:21:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:21:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2023-08-26 15:21:53,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39354395604395603 [2023-08-26 15:21:53,125 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2023-08-26 15:21:53,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2023-08-26 15:21:53,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:53,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2023-08-26 15:21:53,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 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 15:21:53,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:53,137 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 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 15:21:53,137 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 506 flow. Second operand 4 states and 573 transitions. [2023-08-26 15:21:53,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 108 transitions, 1000 flow [2023-08-26 15:21:53,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 108 transitions, 932 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-26 15:21:53,166 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 590 flow [2023-08-26 15:21:53,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=590, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2023-08-26 15:21:53,167 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -16 predicate places. [2023-08-26 15:21:53,167 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 590 flow [2023-08-26 15:21:53,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 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 15:21:53,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:53,168 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, 1, 1] [2023-08-26 15:21:53,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:21:53,168 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:53,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:53,168 INFO L85 PathProgramCache]: Analyzing trace with hash 628683661, now seen corresponding path program 1 times [2023-08-26 15:21:53,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:53,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051165842] [2023-08-26 15:21:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:53,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:21:53,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:53,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051165842] [2023-08-26 15:21:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051165842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:53,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:53,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:21:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419873795] [2023-08-26 15:21:53,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:53,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:21:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:21:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:21:53,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 364 [2023-08-26 15:21:53,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 590 flow. Second operand has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 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 15:21:53,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:53,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 364 [2023-08-26 15:21:53,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:54,075 INFO L124 PetriNetUnfolderBase]: 1965/3133 cut-off events. [2023-08-26 15:21:54,076 INFO L125 PetriNetUnfolderBase]: For 7679/8206 co-relation queries the response was YES. [2023-08-26 15:21:54,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13886 conditions, 3133 events. 1965/3133 cut-off events. For 7679/8206 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 18047 event pairs, 175 based on Foata normal form. 273/3337 useless extension candidates. Maximal degree in co-relation 13864. Up to 1183 conditions per place. [2023-08-26 15:21:54,083 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 75 selfloop transitions, 17 changer transitions 24/121 dead transitions. [2023-08-26 15:21:54,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 1057 flow [2023-08-26 15:21:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:21:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:21:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 914 transitions. [2023-08-26 15:21:54,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4184981684981685 [2023-08-26 15:21:54,085 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 914 transitions. [2023-08-26 15:21:54,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 914 transitions. [2023-08-26 15:21:54,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:54,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 914 transitions. [2023-08-26 15:21:54,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 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 15:21:54,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 364.0) internal successors, (2548), 7 states have internal predecessors, (2548), 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 15:21:54,089 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 364.0) internal successors, (2548), 7 states have internal predecessors, (2548), 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 15:21:54,089 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 590 flow. Second operand 6 states and 914 transitions. [2023-08-26 15:21:54,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 1057 flow [2023-08-26 15:21:54,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 121 transitions, 935 flow, removed 24 selfloop flow, removed 13 redundant places. [2023-08-26 15:21:54,119 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 334 flow [2023-08-26 15:21:54,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2023-08-26 15:21:54,119 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -30 predicate places. [2023-08-26 15:21:54,119 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 334 flow [2023-08-26 15:21:54,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 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 15:21:54,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:54,120 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, 1, 1, 1, 1, 1] [2023-08-26 15:21:54,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:21:54,120 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:54,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2115267023, now seen corresponding path program 1 times [2023-08-26 15:21:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404974401] [2023-08-26 15:21:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:21:54,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:21:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:21:54,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:21:54,267 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:21:54,268 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONASSERT (86 of 87 remaining) [2023-08-26 15:21:54,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 87 remaining) [2023-08-26 15:21:54,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 87 remaining) [2023-08-26 15:21:54,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 87 remaining) [2023-08-26 15:21:54,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 87 remaining) [2023-08-26 15:21:54,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 87 remaining) [2023-08-26 15:21:54,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 87 remaining) [2023-08-26 15:21:54,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 87 remaining) [2023-08-26 15:21:54,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 87 remaining) [2023-08-26 15:21:54,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 87 remaining) [2023-08-26 15:21:54,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 87 remaining) [2023-08-26 15:21:54,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 15:21:54,274 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:54,279 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:21:54,280 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:21:54,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:21:54 BasicIcfg [2023-08-26 15:21:54,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:21:54,374 INFO L158 Benchmark]: Toolchain (without parser) took 74435.87ms. Allocated memory was 329.3MB in the beginning and 9.2GB in the end (delta: 8.9GB). Free memory was 302.6MB in the beginning and 8.1GB in the end (delta: -7.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-26 15:21:54,374 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 329.3MB. Free memory was 306.7MB in the beginning and 306.5MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:21:54,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.31ms. Allocated memory is still 329.3MB. Free memory was 302.6MB in the beginning and 277.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 15:21:54,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.97ms. Allocated memory is still 329.3MB. Free memory was 277.4MB in the beginning and 274.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 15:21:54,375 INFO L158 Benchmark]: Boogie Preprocessor took 25.50ms. Allocated memory is still 329.3MB. Free memory was 274.5MB in the beginning and 271.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:21:54,375 INFO L158 Benchmark]: RCFGBuilder took 1175.14ms. Allocated memory was 329.3MB in the beginning and 396.4MB in the end (delta: 67.1MB). Free memory was 271.5MB in the beginning and 339.5MB in the end (delta: -68.0MB). Peak memory consumption was 97.3MB. Max. memory is 16.0GB. [2023-08-26 15:21:54,375 INFO L158 Benchmark]: TraceAbstraction took 72773.28ms. Allocated memory was 396.4MB in the beginning and 9.2GB in the end (delta: 8.8GB). Free memory was 339.5MB in the beginning and 8.1GB in the end (delta: -7.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-26 15:21:54,376 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.10ms. Allocated memory is still 329.3MB. Free memory was 306.7MB in the beginning and 306.5MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 391.31ms. Allocated memory is still 329.3MB. Free memory was 302.6MB in the beginning and 277.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.97ms. Allocated memory is still 329.3MB. Free memory was 277.4MB in the beginning and 274.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.50ms. Allocated memory is still 329.3MB. Free memory was 274.5MB in the beginning and 271.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1175.14ms. Allocated memory was 329.3MB in the beginning and 396.4MB in the end (delta: 67.1MB). Free memory was 271.5MB in the beginning and 339.5MB in the end (delta: -68.0MB). Peak memory consumption was 97.3MB. Max. memory is 16.0GB. * TraceAbstraction took 72773.28ms. Allocated memory was 396.4MB in the beginning and 9.2GB in the end (delta: 8.8GB). Free memory was 339.5MB in the beginning and 8.1GB in the end (delta: -7.7GB). Peak memory consumption was 1.0GB. 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: 12.4s, 207 PlacesBefore, 100 PlacesAfterwards, 197 TransitionsBefore, 89 TransitionsAfterwards, 8996 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 163 TotalNumberOfCompositions, 43421 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11298, independent: 10567, independent conditional: 0, independent unconditional: 10567, dependent: 731, dependent conditional: 0, dependent unconditional: 731, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3705, independent: 3617, independent conditional: 0, independent unconditional: 3617, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11298, independent: 6950, independent conditional: 0, independent unconditional: 6950, dependent: 643, dependent conditional: 0, dependent unconditional: 643, unknown: 3705, unknown conditional: 0, unknown unconditional: 3705] , Statistics on independence cache: Total cache size (in pairs): 620, Positive cache size: 565, Positive conditional cache size: 0, Positive unconditional cache size: 565, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2225, ((void *)0), P0, ((void *)0))=-2, t2225={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L856] 0 pthread_t t2226; 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={7:0}, t2226={8:0}, weak$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L857] FCALL, FORK 0 pthread_create(&t2226, ((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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2226, ((void *)0), P1, ((void *)0))=-1, t2225={7:0}, t2226={8:0}, weak$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L785] 1 __unbuffered_p0_EBX = 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2227, ((void *)0), P2, ((void *)0))=0, t2225={7:0}, t2226={8:0}, t2227={5:0}, weak$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L797] 2 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=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$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L860] 0 pthread_t t2228; 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={7:0}, t2226={8:0}, t2227={5:0}, t2228={6:0}, weak$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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 __unbuffered_p2_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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_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$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] 3 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_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$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L815] 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) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] 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) [L815] 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) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 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 [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_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$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, 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, pthread_create(&t2228, ((void *)0), P3, ((void *)0))=1, t2225={7:0}, t2226={8:0}, t2227={5:0}, t2228={6:0}, weak$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L829] 4 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 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) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] 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) [L867] 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) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 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 [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 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}, \result={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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, t2225={7:0}, t2226={8:0}, t2227={5:0}, t2228={6:0}, weak$$choice0=0, weak$$choice1=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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}] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] 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) [L878] EXPR 0 \read(y) [L878] 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) [L878] 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) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 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)) [L883] 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)) [L884] 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)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] EXPR 0 \read(y) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L891] 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", "safe019_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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: -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: 857]: 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: 861]: 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: 855]: 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: 859]: 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 9 procedures, 259 locations, 87 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: 72.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 54.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 647 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 647 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1797 IncrementalHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 14 mSDtfsCounter, 1797 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1019occurred in iteration=12, InterpolantAutomatonStates: 77, 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.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 1774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 15:21:54,399 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...