/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 PROGRAM_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/safe001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:20:25,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:20:25,873 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 18:20:25,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:20:25,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:20:25,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:20:25,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:20:25,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:20:25,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:20:25,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:20:25,918 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:20:25,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:20:25,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:20:25,920 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:20:25,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:20:25,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:20:25,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:20:25,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:20:25,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:20:25,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:20:25,921 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:20:25,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:20:25,922 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:20:25,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:20:25,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:20:25,923 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:20:25,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:20:25,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:20:25,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:20:25,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:20:25,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:20:25,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:20:25,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:20:25,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:20:25,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:20:25,926 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 -> PROGRAM_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 18:20:26,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:20:26,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:20:26,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:20:26,270 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:20:26,272 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:20:26,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2023-08-26 18:20:27,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:20:27,595 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:20:27,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2023-08-26 18:20:27,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1687b366a/e8a586bc5d2244e188c2b6b4ab5b5a11/FLAGf614c9811 [2023-08-26 18:20:27,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1687b366a/e8a586bc5d2244e188c2b6b4ab5b5a11 [2023-08-26 18:20:27,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:20:27,629 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:20:27,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:20:27,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:20:27,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:20:27,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:20:27" (1/1) ... [2023-08-26 18:20:27,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a86069d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:27, skipping insertion in model container [2023-08-26 18:20:27,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:20:27" (1/1) ... [2023-08-26 18:20:27,680 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:20:28,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:20:28,115 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:20:28,143 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:20:28,145 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:20:28,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:20:28,238 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:20:28,238 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:20:28,244 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:20:28,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28 WrapperNode [2023-08-26 18:20:28,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:20:28,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:20:28,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:20:28,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:20:28,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,322 INFO L138 Inliner]: procedures = 176, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2023-08-26 18:20:28,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:20:28,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:20:28,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:20:28,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:20:28,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:20:28,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:20:28,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:20:28,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:20:28,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (1/1) ... [2023-08-26 18:20:28,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:20:28,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:20:28,413 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 18:20:28,437 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 18:20:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:20:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:20:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:20:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:20:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:20:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:20:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:20:28,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:20:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:20:28,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:20:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:20:28,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:20:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:20:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:20:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:20:28,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:20:28,453 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 18:20:28,604 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:20:28,606 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:20:29,182 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:20:29,848 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:20:29,848 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:20:29,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:20:29 BoogieIcfgContainer [2023-08-26 18:20:29,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:20:29,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:20:29,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:20:29,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:20:29,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:20:27" (1/3) ... [2023-08-26 18:20:29,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a7a10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:20:29, skipping insertion in model container [2023-08-26 18:20:29,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:20:28" (2/3) ... [2023-08-26 18:20:29,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a7a10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:20:29, skipping insertion in model container [2023-08-26 18:20:29,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:20:29" (3/3) ... [2023-08-26 18:20:29,858 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_rmo.oepc.i [2023-08-26 18:20:29,877 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:20:29,877 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-26 18:20:29,877 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:20:29,993 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:20:30,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 188 transitions, 391 flow [2023-08-26 18:20:30,170 INFO L124 PetriNetUnfolderBase]: 3/185 cut-off events. [2023-08-26 18:20:30,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:20:30,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 185 events. 3/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 18:20:30,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 188 transitions, 391 flow [2023-08-26 18:20:30,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 185 transitions, 379 flow [2023-08-26 18:20:30,188 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:20:30,203 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 185 transitions, 379 flow [2023-08-26 18:20:30,206 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 185 transitions, 379 flow [2023-08-26 18:20:30,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 185 transitions, 379 flow [2023-08-26 18:20:30,270 INFO L124 PetriNetUnfolderBase]: 3/185 cut-off events. [2023-08-26 18:20:30,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:20:30,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 185 events. 3/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 18:20:30,275 INFO L119 LiptonReduction]: Number of co-enabled transitions 8612 [2023-08-26 18:20:49,543 INFO L134 LiptonReduction]: Checked pairs total: 44570 [2023-08-26 18:20:49,543 INFO L136 LiptonReduction]: Total number of compositions: 153 [2023-08-26 18:20:49,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:20:49,560 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;@65ababf5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:20:49,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 100 error locations. [2023-08-26 18:20:49,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:20:49,561 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:20:49,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:20:49,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:49,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:20:49,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:20:49,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1203, now seen corresponding path program 1 times [2023-08-26 18:20:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008229122] [2023-08-26 18:20:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:49,673 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 18:20:49,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:49,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008229122] [2023-08-26 18:20:49,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008229122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:49,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:49,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:20:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100647473] [2023-08-26 18:20:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:49,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:20:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:49,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:20:49,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:20:49,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 341 [2023-08-26 18:20:49,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 185 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:20:49,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:49,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 341 [2023-08-26 18:20:49,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:53,471 INFO L124 PetriNetUnfolderBase]: 16294/23361 cut-off events. [2023-08-26 18:20:53,471 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-26 18:20:53,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46288 conditions, 23361 events. 16294/23361 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2272. Compared 167648 event pairs, 16294 based on Foata normal form. 400/9766 useless extension candidates. Maximal degree in co-relation 46277. Up to 22831 conditions per place. [2023-08-26 18:20:53,630 INFO L140 encePairwiseOnDemand]: 303/341 looper letters, 43 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-26 18:20:53,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 195 flow [2023-08-26 18:20:53,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:20:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:20:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 331 transitions. [2023-08-26 18:20:53,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48533724340175954 [2023-08-26 18:20:53,649 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 331 transitions. [2023-08-26 18:20:53,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 331 transitions. [2023-08-26 18:20:53,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:53,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 331 transitions. [2023-08-26 18:20:53,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 0 states have call successors, (0), 0 states 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 18:20:53,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states 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 18:20:53,663 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states 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 18:20:53,664 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 185 flow. Second operand 2 states and 331 transitions. [2023-08-26 18:20:53,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 195 flow [2023-08-26 18:20:53,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:20:53,672 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-08-26 18:20:53,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-26 18:20:53,677 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2023-08-26 18:20:53,677 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-08-26 18:20:53,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:20:53,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:53,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:20:53,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:20:53,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:20:53,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1189666, now seen corresponding path program 1 times [2023-08-26 18:20:53,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:53,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615523784] [2023-08-26 18:20:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:53,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:53,971 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 18:20:53,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:53,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615523784] [2023-08-26 18:20:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615523784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:53,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:53,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:20:53,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910382235] [2023-08-26 18:20:53,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:53,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:20:53,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:53,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:20:53,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:20:53,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 341 [2023-08-26 18:20:53,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:20:53,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:53,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 341 [2023-08-26 18:20:53,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:55,929 INFO L124 PetriNetUnfolderBase]: 9290/13304 cut-off events. [2023-08-26 18:20:55,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:20:55,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26524 conditions, 13304 events. 9290/13304 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 78516 event pairs, 9290 based on Foata normal form. 0/7124 useless extension candidates. Maximal degree in co-relation 26521. Up to 13143 conditions per place. [2023-08-26 18:20:55,983 INFO L140 encePairwiseOnDemand]: 330/341 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-26 18:20:55,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 162 flow [2023-08-26 18:20:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:20:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:20:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-26 18:20:55,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2023-08-26 18:20:55,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-26 18:20:55,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-26 18:20:55,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:55,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-26 18:20:55,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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 18:20:55,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:20:55,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:20:55,990 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 363 transitions. [2023-08-26 18:20:55,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 162 flow [2023-08-26 18:20:55,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:20:55,991 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 88 flow [2023-08-26 18:20:55,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-26 18:20:55,993 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2023-08-26 18:20:55,993 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 88 flow [2023-08-26 18:20:55,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:20:55,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:55,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:20:55,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:20:55,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:20:56,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1189678, now seen corresponding path program 1 times [2023-08-26 18:20:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:56,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103847274] [2023-08-26 18:20:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:56,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:56,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 18:20:56,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:56,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103847274] [2023-08-26 18:20:56,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103847274] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:56,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:56,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:20:56,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039715104] [2023-08-26 18:20:56,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:56,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:20:56,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:56,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:20:56,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:20:56,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 341 [2023-08-26 18:20:56,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:20:56,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:56,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 341 [2023-08-26 18:20:56,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:56,955 INFO L124 PetriNetUnfolderBase]: 4162/6471 cut-off events. [2023-08-26 18:20:56,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:20:56,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12909 conditions, 6471 events. 4162/6471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 39772 event pairs, 2573 based on Foata normal form. 0/5246 useless extension candidates. Maximal degree in co-relation 12905. Up to 3816 conditions per place. [2023-08-26 18:20:56,980 INFO L140 encePairwiseOnDemand]: 320/341 looper letters, 37 selfloop transitions, 10 changer transitions 1/49 dead transitions. [2023-08-26 18:20:56,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 202 flow [2023-08-26 18:20:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:20:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:20:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-26 18:20:56,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35386119257087 [2023-08-26 18:20:56,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-26 18:20:56,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-26 18:20:56,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:56,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-26 18:20:56,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:20:56,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:20:56,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:20:56,986 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 88 flow. Second operand 3 states and 362 transitions. [2023-08-26 18:20:56,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 202 flow [2023-08-26 18:20:56,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:20:56,988 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 167 flow [2023-08-26 18:20:56,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 18:20:56,989 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2023-08-26 18:20:56,989 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 167 flow [2023-08-26 18:20:56,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:20:56,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:56,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:56,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:20:56,990 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:20:56,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1344831344, now seen corresponding path program 1 times [2023-08-26 18:20:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113646464] [2023-08-26 18:20:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:57,378 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 18:20:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:57,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113646464] [2023-08-26 18:20:57,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113646464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:57,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:57,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:20:57,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814693593] [2023-08-26 18:20:57,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:57,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:20:57,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:57,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:20:57,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:20:57,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 341 [2023-08-26 18:20:57,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 18:20:57,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:57,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 341 [2023-08-26 18:20:57,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:58,280 INFO L124 PetriNetUnfolderBase]: 4703/7446 cut-off events. [2023-08-26 18:20:58,280 INFO L125 PetriNetUnfolderBase]: For 2637/2684 co-relation queries the response was YES. [2023-08-26 18:20:58,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20382 conditions, 7446 events. 4703/7446 cut-off events. For 2637/2684 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 46205 event pairs, 2059 based on Foata normal form. 23/6951 useless extension candidates. Maximal degree in co-relation 20377. Up to 6395 conditions per place. [2023-08-26 18:20:58,310 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 55 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-26 18:20:58,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 365 flow [2023-08-26 18:20:58,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:20:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:20:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-26 18:20:58,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2023-08-26 18:20:58,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-26 18:20:58,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-26 18:20:58,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:58,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-26 18:20:58,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:20:58,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:20:58,316 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:20:58,316 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 167 flow. Second operand 3 states and 414 transitions. [2023-08-26 18:20:58,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 365 flow [2023-08-26 18:20:58,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:20:58,344 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 184 flow [2023-08-26 18:20:58,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-08-26 18:20:58,346 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2023-08-26 18:20:58,346 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 184 flow [2023-08-26 18:20:58,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 18:20:58,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:58,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:58,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:20:58,347 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:20:58,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1344830978, now seen corresponding path program 1 times [2023-08-26 18:20:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:58,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372614354] [2023-08-26 18:20:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:58,437 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 18:20:58,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:58,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372614354] [2023-08-26 18:20:58,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372614354] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:58,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:58,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:20:58,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341697321] [2023-08-26 18:20:58,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:58,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:20:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:58,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:20:58,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:20:58,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 341 [2023-08-26 18:20:58,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 18:20:58,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:58,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 341 [2023-08-26 18:20:58,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:59,191 INFO L124 PetriNetUnfolderBase]: 4349/7002 cut-off events. [2023-08-26 18:20:59,191 INFO L125 PetriNetUnfolderBase]: For 1972/2074 co-relation queries the response was YES. [2023-08-26 18:20:59,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18662 conditions, 7002 events. 4349/7002 cut-off events. For 1972/2074 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 45385 event pairs, 2107 based on Foata normal form. 18/5842 useless extension candidates. Maximal degree in co-relation 18656. Up to 4059 conditions per place. [2023-08-26 18:20:59,219 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 67 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2023-08-26 18:20:59,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 441 flow [2023-08-26 18:20:59,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:20:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:20:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-26 18:20:59,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173998044965787 [2023-08-26 18:20:59,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-26 18:20:59,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-26 18:20:59,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:59,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-26 18:20:59,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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 18:20:59,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:20:59,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:20:59,225 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 184 flow. Second operand 3 states and 427 transitions. [2023-08-26 18:20:59,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 441 flow [2023-08-26 18:20:59,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:20:59,230 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 192 flow [2023-08-26 18:20:59,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=192, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2023-08-26 18:20:59,230 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -45 predicate places. [2023-08-26 18:20:59,231 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 192 flow [2023-08-26 18:20:59,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 18:20:59,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:59,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:59,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:20:59,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:20:59,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1259903137, now seen corresponding path program 1 times [2023-08-26 18:20:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:59,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543573695] [2023-08-26 18:20:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:59,517 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 18:20:59,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:59,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543573695] [2023-08-26 18:20:59,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543573695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:59,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:59,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:20:59,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489516606] [2023-08-26 18:20:59,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:59,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:20:59,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:59,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:20:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:20:59,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 341 [2023-08-26 18:20:59,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 18:20:59,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:59,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 341 [2023-08-26 18:20:59,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:00,314 INFO L124 PetriNetUnfolderBase]: 5006/8078 cut-off events. [2023-08-26 18:21:00,314 INFO L125 PetriNetUnfolderBase]: For 2474/2474 co-relation queries the response was YES. [2023-08-26 18:21:00,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23297 conditions, 8078 events. 5006/8078 cut-off events. For 2474/2474 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 53002 event pairs, 1758 based on Foata normal form. 0/7313 useless extension candidates. Maximal degree in co-relation 23290. Up to 5176 conditions per place. [2023-08-26 18:21:00,348 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 63 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-08-26 18:21:00,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 406 flow [2023-08-26 18:21:00,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:21:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:21:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-08-26 18:21:00,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3291788856304985 [2023-08-26 18:21:00,350 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-08-26 18:21:00,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-08-26 18:21:00,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:00,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-08-26 18:21:00,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:00,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states 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 18:21:00,355 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states 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 18:21:00,355 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 192 flow. Second operand 4 states and 449 transitions. [2023-08-26 18:21:00,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 406 flow [2023-08-26 18:21:00,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:21:00,358 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 217 flow [2023-08-26 18:21:00,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2023-08-26 18:21:00,359 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -44 predicate places. [2023-08-26 18:21:00,359 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 217 flow [2023-08-26 18:21:00,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 18:21:00,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:00,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:00,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:21:00,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:00,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1259903136, now seen corresponding path program 1 times [2023-08-26 18:21:00,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:00,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881110962] [2023-08-26 18:21:00,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:00,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:00,986 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 18:21:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881110962] [2023-08-26 18:21:00,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881110962] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:00,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:21:00,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769006297] [2023-08-26 18:21:00,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:00,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:21:00,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:00,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:21:00,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:21:00,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 341 [2023-08-26 18:21:00,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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 18:21:00,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:00,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 341 [2023-08-26 18:21:00,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:01,892 INFO L124 PetriNetUnfolderBase]: 4899/7888 cut-off events. [2023-08-26 18:21:01,892 INFO L125 PetriNetUnfolderBase]: For 4514/4514 co-relation queries the response was YES. [2023-08-26 18:21:01,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24182 conditions, 7888 events. 4899/7888 cut-off events. For 4514/4514 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 50205 event pairs, 1727 based on Foata normal form. 74/7197 useless extension candidates. Maximal degree in co-relation 24174. Up to 4233 conditions per place. [2023-08-26 18:21:01,928 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 98 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2023-08-26 18:21:01,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 663 flow [2023-08-26 18:21:01,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:21:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:21:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 826 transitions. [2023-08-26 18:21:01,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3027859237536657 [2023-08-26 18:21:01,932 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 826 transitions. [2023-08-26 18:21:01,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 826 transitions. [2023-08-26 18:21:01,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:01,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 826 transitions. [2023-08-26 18:21:01,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.25) internal successors, (826), 8 states have internal predecessors, (826), 0 states have call successors, (0), 0 states 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 18:21:01,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states 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 18:21:01,940 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states 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 18:21:01,940 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 217 flow. Second operand 8 states and 826 transitions. [2023-08-26 18:21:01,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 663 flow [2023-08-26 18:21:01,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 649 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:21:01,952 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 235 flow [2023-08-26 18:21:01,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2023-08-26 18:21:01,953 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -41 predicate places. [2023-08-26 18:21:01,953 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 235 flow [2023-08-26 18:21:01,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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 18:21:01,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:01,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:01,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:21:01,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:01,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1594450091, now seen corresponding path program 1 times [2023-08-26 18:21:01,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:01,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362371864] [2023-08-26 18:21:01,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:01,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:02,729 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 18:21:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:02,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362371864] [2023-08-26 18:21:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362371864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:02,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:21:02,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752414174] [2023-08-26 18:21:02,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:02,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:21:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:21:02,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:21:02,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 341 [2023-08-26 18:21:02,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 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 18:21:02,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:02,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 341 [2023-08-26 18:21:02,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:03,628 INFO L124 PetriNetUnfolderBase]: 4849/7829 cut-off events. [2023-08-26 18:21:03,628 INFO L125 PetriNetUnfolderBase]: For 4641/4641 co-relation queries the response was YES. [2023-08-26 18:21:03,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23750 conditions, 7829 events. 4849/7829 cut-off events. For 4641/4641 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 50261 event pairs, 2716 based on Foata normal form. 3/7064 useless extension candidates. Maximal degree in co-relation 23743. Up to 7378 conditions per place. [2023-08-26 18:21:03,651 INFO L140 encePairwiseOnDemand]: 332/341 looper letters, 77 selfloop transitions, 24 changer transitions 0/103 dead transitions. [2023-08-26 18:21:03,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 673 flow [2023-08-26 18:21:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:21:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:21:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 710 transitions. [2023-08-26 18:21:03,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29744449099287806 [2023-08-26 18:21:03,654 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 710 transitions. [2023-08-26 18:21:03,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 710 transitions. [2023-08-26 18:21:03,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:03,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 710 transitions. [2023-08-26 18:21:03,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states 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 18:21:03,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states 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 18:21:03,660 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states 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 18:21:03,660 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 235 flow. Second operand 7 states and 710 transitions. [2023-08-26 18:21:03,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 673 flow [2023-08-26 18:21:03,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 666 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:03,670 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 430 flow [2023-08-26 18:21:03,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=430, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2023-08-26 18:21:03,675 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -33 predicate places. [2023-08-26 18:21:03,675 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 430 flow [2023-08-26 18:21:03,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 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 18:21:03,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:03,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:03,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:21:03,676 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:03,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:03,676 INFO L85 PathProgramCache]: Analyzing trace with hash 316380510, now seen corresponding path program 1 times [2023-08-26 18:21:03,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:03,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995536680] [2023-08-26 18:21:03,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:03,761 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 18:21:03,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:03,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995536680] [2023-08-26 18:21:03,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995536680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:03,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:03,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:21:03,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757963761] [2023-08-26 18:21:03,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:03,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:21:03,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:03,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:21:03,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:21:03,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 341 [2023-08-26 18:21:03,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:03,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:03,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 341 [2023-08-26 18:21:03,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:04,846 INFO L124 PetriNetUnfolderBase]: 6478/10361 cut-off events. [2023-08-26 18:21:04,847 INFO L125 PetriNetUnfolderBase]: For 11730/12120 co-relation queries the response was YES. [2023-08-26 18:21:04,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32769 conditions, 10361 events. 6478/10361 cut-off events. For 11730/12120 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 73072 event pairs, 2002 based on Foata normal form. 120/9488 useless extension candidates. Maximal degree in co-relation 32759. Up to 5786 conditions per place. [2023-08-26 18:21:04,884 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 80 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2023-08-26 18:21:04,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 716 flow [2023-08-26 18:21:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:21:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:21:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 18:21:04,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095796676441838 [2023-08-26 18:21:04,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 18:21:04,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 18:21:04,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:04,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 18:21:04,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 18:21:04,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:21:04,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:21:04,888 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 430 flow. Second operand 3 states and 419 transitions. [2023-08-26 18:21:04,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 716 flow [2023-08-26 18:21:04,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 709 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:04,953 INFO L231 Difference]: Finished difference. Result has 66 places, 74 transitions, 440 flow [2023-08-26 18:21:04,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2023-08-26 18:21:04,954 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -31 predicate places. [2023-08-26 18:21:04,954 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 440 flow [2023-08-26 18:21:04,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:04,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:04,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:04,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:21:04,955 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:04,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1357013678, now seen corresponding path program 1 times [2023-08-26 18:21:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:04,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719512310] [2023-08-26 18:21:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:05,196 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 18:21:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:05,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719512310] [2023-08-26 18:21:05,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719512310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:21:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770585074] [2023-08-26 18:21:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:05,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:21:05,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:05,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:21:05,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:21:05,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 341 [2023-08-26 18:21:05,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:05,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:05,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 341 [2023-08-26 18:21:05,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:06,270 INFO L124 PetriNetUnfolderBase]: 5780/9550 cut-off events. [2023-08-26 18:21:06,271 INFO L125 PetriNetUnfolderBase]: For 10757/10879 co-relation queries the response was YES. [2023-08-26 18:21:06,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30383 conditions, 9550 events. 5780/9550 cut-off events. For 10757/10879 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 68283 event pairs, 1938 based on Foata normal form. 34/8732 useless extension candidates. Maximal degree in co-relation 30371. Up to 6660 conditions per place. [2023-08-26 18:21:06,313 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 71 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-08-26 18:21:06,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 98 transitions, 734 flow [2023-08-26 18:21:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:21:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:21:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-26 18:21:06,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2023-08-26 18:21:06,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-26 18:21:06,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-26 18:21:06,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:06,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-26 18:21:06,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:06,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:21:06,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:21:06,318 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 440 flow. Second operand 3 states and 414 transitions. [2023-08-26 18:21:06,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 98 transitions, 734 flow [2023-08-26 18:21:06,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:06,419 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 454 flow [2023-08-26 18:21:06,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2023-08-26 18:21:06,420 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -29 predicate places. [2023-08-26 18:21:06,420 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 454 flow [2023-08-26 18:21:06,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:06,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:06,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:06,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:21:06,421 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:06,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1304159458, now seen corresponding path program 1 times [2023-08-26 18:21:06,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:06,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230300362] [2023-08-26 18:21:06,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:06,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:06,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 18:21:06,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:06,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230300362] [2023-08-26 18:21:06,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230300362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:06,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:06,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:21:06,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067354479] [2023-08-26 18:21:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:06,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:21:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:21:06,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:21:06,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 341 [2023-08-26 18:21:06,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:06,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:06,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 341 [2023-08-26 18:21:06,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:07,657 INFO L124 PetriNetUnfolderBase]: 6270/10179 cut-off events. [2023-08-26 18:21:07,658 INFO L125 PetriNetUnfolderBase]: For 13367/13528 co-relation queries the response was YES. [2023-08-26 18:21:07,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33867 conditions, 10179 events. 6270/10179 cut-off events. For 13367/13528 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 70855 event pairs, 3331 based on Foata normal form. 77/9377 useless extension candidates. Maximal degree in co-relation 33854. Up to 8560 conditions per place. [2023-08-26 18:21:07,695 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 83 selfloop transitions, 5 changer transitions 1/109 dead transitions. [2023-08-26 18:21:07,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 109 transitions, 840 flow [2023-08-26 18:21:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:21:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:21:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-26 18:21:07,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2023-08-26 18:21:07,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-26 18:21:07,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-26 18:21:07,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:07,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-26 18:21:07,698 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 18:21:07,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:21:07,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:21:07,700 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 454 flow. Second operand 3 states and 417 transitions. [2023-08-26 18:21:07,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 109 transitions, 840 flow [2023-08-26 18:21:07,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:21:07,756 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 469 flow [2023-08-26 18:21:07,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2023-08-26 18:21:07,757 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -28 predicate places. [2023-08-26 18:21:07,757 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 469 flow [2023-08-26 18:21:07,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:07,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:07,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:07,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:21:07,758 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:07,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:07,758 INFO L85 PathProgramCache]: Analyzing trace with hash -402211426, now seen corresponding path program 1 times [2023-08-26 18:21:07,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:07,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75370716] [2023-08-26 18:21:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:07,883 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 18:21:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75370716] [2023-08-26 18:21:07,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75370716] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:07,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:07,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:21:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408478775] [2023-08-26 18:21:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:07,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:21:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:07,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:21:07,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:21:07,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 341 [2023-08-26 18:21:07,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:07,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:07,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 341 [2023-08-26 18:21:07,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:08,821 INFO L124 PetriNetUnfolderBase]: 5243/8457 cut-off events. [2023-08-26 18:21:08,821 INFO L125 PetriNetUnfolderBase]: For 10388/10448 co-relation queries the response was YES. [2023-08-26 18:21:08,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28755 conditions, 8457 events. 5243/8457 cut-off events. For 10388/10448 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 55897 event pairs, 2204 based on Foata normal form. 117/8067 useless extension candidates. Maximal degree in co-relation 28741. Up to 2968 conditions per place. [2023-08-26 18:21:08,859 INFO L140 encePairwiseOnDemand]: 324/341 looper letters, 84 selfloop transitions, 20 changer transitions 0/107 dead transitions. [2023-08-26 18:21:08,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 871 flow [2023-08-26 18:21:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:21:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:21:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-08-26 18:21:08,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33284457478005863 [2023-08-26 18:21:08,861 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-08-26 18:21:08,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-08-26 18:21:08,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:08,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-08-26 18:21:08,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states 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 18:21:08,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states 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 18:21:08,865 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states 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 18:21:08,865 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 469 flow. Second operand 4 states and 454 transitions. [2023-08-26 18:21:08,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 871 flow [2023-08-26 18:21:08,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 856 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:08,962 INFO L231 Difference]: Finished difference. Result has 73 places, 85 transitions, 631 flow [2023-08-26 18:21:08,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=631, PETRI_PLACES=73, PETRI_TRANSITIONS=85} [2023-08-26 18:21:08,963 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -24 predicate places. [2023-08-26 18:21:08,963 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 85 transitions, 631 flow [2023-08-26 18:21:08,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:08,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:08,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:08,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:21:08,964 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:08,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash 64988045, now seen corresponding path program 1 times [2023-08-26 18:21:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361464000] [2023-08-26 18:21:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:10,906 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 18:21:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361464000] [2023-08-26 18:21:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361464000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:10,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:21:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772230812] [2023-08-26 18:21:10,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:10,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:21:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:10,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:21:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:21:10,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 341 [2023-08-26 18:21:10,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 85 transitions, 631 flow. Second operand has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states 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 18:21:10,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:10,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 341 [2023-08-26 18:21:10,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:12,795 INFO L124 PetriNetUnfolderBase]: 8269/13169 cut-off events. [2023-08-26 18:21:12,795 INFO L125 PetriNetUnfolderBase]: For 20582/20718 co-relation queries the response was YES. [2023-08-26 18:21:12,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49354 conditions, 13169 events. 8269/13169 cut-off events. For 20582/20718 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 92803 event pairs, 2216 based on Foata normal form. 65/12976 useless extension candidates. Maximal degree in co-relation 49339. Up to 8583 conditions per place. [2023-08-26 18:21:12,855 INFO L140 encePairwiseOnDemand]: 322/341 looper letters, 146 selfloop transitions, 80 changer transitions 2/231 dead transitions. [2023-08-26 18:21:12,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 231 transitions, 1955 flow [2023-08-26 18:21:12,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:21:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:21:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1108 transitions. [2023-08-26 18:21:12,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2953878965609171 [2023-08-26 18:21:12,858 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1108 transitions. [2023-08-26 18:21:12,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1108 transitions. [2023-08-26 18:21:12,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:12,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1108 transitions. [2023-08-26 18:21:12,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.72727272727273) internal successors, (1108), 11 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states 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 18:21:12,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 341.0) internal successors, (4092), 12 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states 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 18:21:12,865 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 341.0) internal successors, (4092), 12 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states 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 18:21:12,866 INFO L175 Difference]: Start difference. First operand has 73 places, 85 transitions, 631 flow. Second operand 11 states and 1108 transitions. [2023-08-26 18:21:12,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 231 transitions, 1955 flow [2023-08-26 18:21:13,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 231 transitions, 1942 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:13,068 INFO L231 Difference]: Finished difference. Result has 87 places, 151 transitions, 1442 flow [2023-08-26 18:21:13,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1442, PETRI_PLACES=87, PETRI_TRANSITIONS=151} [2023-08-26 18:21:13,068 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -10 predicate places. [2023-08-26 18:21:13,068 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 151 transitions, 1442 flow [2023-08-26 18:21:13,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states 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 18:21:13,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:13,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:13,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:21:13,069 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:13,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1150793027, now seen corresponding path program 2 times [2023-08-26 18:21:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:13,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433264039] [2023-08-26 18:21:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:13,702 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 18:21:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433264039] [2023-08-26 18:21:13,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433264039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:13,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:21:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736005962] [2023-08-26 18:21:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:13,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:21:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:13,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:21:13,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:21:13,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 341 [2023-08-26 18:21:13,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 151 transitions, 1442 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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 18:21:13,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:13,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 341 [2023-08-26 18:21:13,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:16,122 INFO L124 PetriNetUnfolderBase]: 12541/20102 cut-off events. [2023-08-26 18:21:16,123 INFO L125 PetriNetUnfolderBase]: For 60151/60480 co-relation queries the response was YES. [2023-08-26 18:21:16,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88777 conditions, 20102 events. 12541/20102 cut-off events. For 60151/60480 co-relation queries the response was YES. Maximal size of possible extension queue 1404. Compared 154199 event pairs, 3691 based on Foata normal form. 122/19862 useless extension candidates. Maximal degree in co-relation 88755. Up to 9841 conditions per place. [2023-08-26 18:21:16,246 INFO L140 encePairwiseOnDemand]: 332/341 looper letters, 232 selfloop transitions, 43 changer transitions 0/278 dead transitions. [2023-08-26 18:21:16,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 278 transitions, 3084 flow [2023-08-26 18:21:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:21:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:21:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 722 transitions. [2023-08-26 18:21:16,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3024717218265605 [2023-08-26 18:21:16,250 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 722 transitions. [2023-08-26 18:21:16,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 722 transitions. [2023-08-26 18:21:16,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:16,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 722 transitions. [2023-08-26 18:21:16,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.14285714285714) internal successors, (722), 7 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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 18:21:16,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states 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 18:21:16,255 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states 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 18:21:16,256 INFO L175 Difference]: Start difference. First operand has 87 places, 151 transitions, 1442 flow. Second operand 7 states and 722 transitions. [2023-08-26 18:21:16,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 278 transitions, 3084 flow [2023-08-26 18:21:17,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 278 transitions, 2939 flow, removed 72 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:17,103 INFO L231 Difference]: Finished difference. Result has 96 places, 179 transitions, 1763 flow [2023-08-26 18:21:17,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1763, PETRI_PLACES=96, PETRI_TRANSITIONS=179} [2023-08-26 18:21:17,103 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2023-08-26 18:21:17,104 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 179 transitions, 1763 flow [2023-08-26 18:21:17,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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 18:21:17,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:17,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:17,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:21:17,104 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:17,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:17,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1281841479, now seen corresponding path program 3 times [2023-08-26 18:21:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:17,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324640519] [2023-08-26 18:21:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:18,322 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 18:21:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:18,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324640519] [2023-08-26 18:21:18,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324640519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:18,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:18,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:21:18,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095920818] [2023-08-26 18:21:18,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:18,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:21:18,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:18,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:21:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:21:18,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 341 [2023-08-26 18:21:18,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 179 transitions, 1763 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 18:21:18,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:18,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 341 [2023-08-26 18:21:18,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:21,715 INFO L124 PetriNetUnfolderBase]: 14937/24116 cut-off events. [2023-08-26 18:21:21,715 INFO L125 PetriNetUnfolderBase]: For 76248/76541 co-relation queries the response was YES. [2023-08-26 18:21:21,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108687 conditions, 24116 events. 14937/24116 cut-off events. For 76248/76541 co-relation queries the response was YES. Maximal size of possible extension queue 1794. Compared 193155 event pairs, 4244 based on Foata normal form. 119/23764 useless extension candidates. Maximal degree in co-relation 108661. Up to 12464 conditions per place. [2023-08-26 18:21:21,888 INFO L140 encePairwiseOnDemand]: 331/341 looper letters, 243 selfloop transitions, 114 changer transitions 8/368 dead transitions. [2023-08-26 18:21:21,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 368 transitions, 4208 flow [2023-08-26 18:21:21,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:21:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:21:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 906 transitions. [2023-08-26 18:21:21,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29521016617790813 [2023-08-26 18:21:21,891 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 906 transitions. [2023-08-26 18:21:21,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 906 transitions. [2023-08-26 18:21:21,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:21,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 906 transitions. [2023-08-26 18:21:21,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.66666666666667) internal successors, (906), 9 states have internal predecessors, (906), 0 states have call successors, (0), 0 states 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 18:21:21,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states 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 18:21:21,896 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states 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 18:21:21,896 INFO L175 Difference]: Start difference. First operand has 96 places, 179 transitions, 1763 flow. Second operand 9 states and 906 transitions. [2023-08-26 18:21:21,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 368 transitions, 4208 flow [2023-08-26 18:21:23,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 368 transitions, 4199 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:23,098 INFO L231 Difference]: Finished difference. Result has 108 places, 244 transitions, 3011 flow [2023-08-26 18:21:23,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3011, PETRI_PLACES=108, PETRI_TRANSITIONS=244} [2023-08-26 18:21:23,099 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 11 predicate places. [2023-08-26 18:21:23,099 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 244 transitions, 3011 flow [2023-08-26 18:21:23,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 18:21:23,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:23,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:23,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:21:23,100 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:23,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1035772113, now seen corresponding path program 1 times [2023-08-26 18:21:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:23,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166368998] [2023-08-26 18:21:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:23,979 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 18:21:23,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:23,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166368998] [2023-08-26 18:21:23,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166368998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:23,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:23,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:21:23,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364929873] [2023-08-26 18:21:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:23,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:21:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:23,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:21:23,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:21:23,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 341 [2023-08-26 18:21:23,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 244 transitions, 3011 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 18:21:23,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:23,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 341 [2023-08-26 18:21:23,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:28,050 INFO L124 PetriNetUnfolderBase]: 16688/26957 cut-off events. [2023-08-26 18:21:28,051 INFO L125 PetriNetUnfolderBase]: For 151110/151499 co-relation queries the response was YES. [2023-08-26 18:21:28,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138316 conditions, 26957 events. 16688/26957 cut-off events. For 151110/151499 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 218515 event pairs, 7003 based on Foata normal form. 240/26456 useless extension candidates. Maximal degree in co-relation 138284. Up to 21154 conditions per place. [2023-08-26 18:21:28,311 INFO L140 encePairwiseOnDemand]: 331/341 looper letters, 290 selfloop transitions, 58 changer transitions 2/365 dead transitions. [2023-08-26 18:21:28,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 365 transitions, 4910 flow [2023-08-26 18:21:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:21:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:21:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 625 transitions. [2023-08-26 18:21:28,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2023-08-26 18:21:28,314 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 625 transitions. [2023-08-26 18:21:28,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 625 transitions. [2023-08-26 18:21:28,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:28,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 625 transitions. [2023-08-26 18:21:28,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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 18:21:28,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states 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 18:21:28,318 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states 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 18:21:28,318 INFO L175 Difference]: Start difference. First operand has 108 places, 244 transitions, 3011 flow. Second operand 5 states and 625 transitions. [2023-08-26 18:21:28,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 365 transitions, 4910 flow [2023-08-26 18:21:30,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 365 transitions, 4843 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-08-26 18:21:30,599 INFO L231 Difference]: Finished difference. Result has 113 places, 272 transitions, 3555 flow [2023-08-26 18:21:30,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2962, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3555, PETRI_PLACES=113, PETRI_TRANSITIONS=272} [2023-08-26 18:21:30,600 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 16 predicate places. [2023-08-26 18:21:30,600 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 272 transitions, 3555 flow [2023-08-26 18:21:30,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 18:21:30,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:30,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:30,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:21:30,601 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:30,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash 416348371, now seen corresponding path program 1 times [2023-08-26 18:21:30,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:30,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71540379] [2023-08-26 18:21:30,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:30,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:30,837 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 18:21:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71540379] [2023-08-26 18:21:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71540379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:30,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:21:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183137298] [2023-08-26 18:21:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:30,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:21:30,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:30,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:21:30,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:21:30,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 341 [2023-08-26 18:21:30,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 272 transitions, 3555 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:30,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:30,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 341 [2023-08-26 18:21:30,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:34,731 INFO L124 PetriNetUnfolderBase]: 12683/20686 cut-off events. [2023-08-26 18:21:34,731 INFO L125 PetriNetUnfolderBase]: For 119460/119689 co-relation queries the response was YES. [2023-08-26 18:21:34,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108076 conditions, 20686 events. 12683/20686 cut-off events. For 119460/119689 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 162351 event pairs, 4326 based on Foata normal form. 656/21004 useless extension candidates. Maximal degree in co-relation 108040. Up to 8601 conditions per place. [2023-08-26 18:21:34,899 INFO L140 encePairwiseOnDemand]: 324/341 looper letters, 299 selfloop transitions, 63 changer transitions 2/367 dead transitions. [2023-08-26 18:21:34,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 367 transitions, 5415 flow [2023-08-26 18:21:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:21:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:21:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 647 transitions. [2023-08-26 18:21:34,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31622678396871945 [2023-08-26 18:21:34,901 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 647 transitions. [2023-08-26 18:21:34,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 647 transitions. [2023-08-26 18:21:34,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:34,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 647 transitions. [2023-08-26 18:21:34,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states 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 18:21:34,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states 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 18:21:34,905 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states 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 18:21:34,906 INFO L175 Difference]: Start difference. First operand has 113 places, 272 transitions, 3555 flow. Second operand 6 states and 647 transitions. [2023-08-26 18:21:34,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 367 transitions, 5415 flow [2023-08-26 18:21:35,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 367 transitions, 5306 flow, removed 35 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:35,844 INFO L231 Difference]: Finished difference. Result has 119 places, 292 transitions, 4056 flow [2023-08-26 18:21:35,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=3493, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4056, PETRI_PLACES=119, PETRI_TRANSITIONS=292} [2023-08-26 18:21:35,844 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 22 predicate places. [2023-08-26 18:21:35,844 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 292 transitions, 4056 flow [2023-08-26 18:21:35,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:21:35,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:35,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:35,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:21:35,845 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:35,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1535426138, now seen corresponding path program 1 times [2023-08-26 18:21:35,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:35,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635946066] [2023-08-26 18:21:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:37,088 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 18:21:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635946066] [2023-08-26 18:21:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635946066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:37,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:21:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491052424] [2023-08-26 18:21:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:37,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:21:37,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:37,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:21:37,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:21:37,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 341 [2023-08-26 18:21:37,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 292 transitions, 4056 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 18:21:37,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:37,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 341 [2023-08-26 18:21:37,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:42,037 INFO L124 PetriNetUnfolderBase]: 17023/28211 cut-off events. [2023-08-26 18:21:42,037 INFO L125 PetriNetUnfolderBase]: For 191234/191696 co-relation queries the response was YES. [2023-08-26 18:21:42,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154160 conditions, 28211 events. 17023/28211 cut-off events. For 191234/191696 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 239715 event pairs, 4909 based on Foata normal form. 217/27620 useless extension candidates. Maximal degree in co-relation 154123. Up to 15706 conditions per place. [2023-08-26 18:21:42,318 INFO L140 encePairwiseOnDemand]: 332/341 looper letters, 303 selfloop transitions, 130 changer transitions 0/448 dead transitions. [2023-08-26 18:21:42,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 448 transitions, 6914 flow [2023-08-26 18:21:42,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:21:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:21:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2023-08-26 18:21:42,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36422287390029323 [2023-08-26 18:21:42,321 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2023-08-26 18:21:42,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2023-08-26 18:21:42,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:42,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2023-08-26 18:21:42,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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 18:21:42,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states 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 18:21:42,325 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states 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 18:21:42,325 INFO L175 Difference]: Start difference. First operand has 119 places, 292 transitions, 4056 flow. Second operand 5 states and 621 transitions. [2023-08-26 18:21:42,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 448 transitions, 6914 flow [2023-08-26 18:21:44,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 448 transitions, 6798 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-26 18:21:44,875 INFO L231 Difference]: Finished difference. Result has 122 places, 350 transitions, 5203 flow [2023-08-26 18:21:44,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=3997, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5203, PETRI_PLACES=122, PETRI_TRANSITIONS=350} [2023-08-26 18:21:44,876 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 25 predicate places. [2023-08-26 18:21:44,876 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 350 transitions, 5203 flow [2023-08-26 18:21:44,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 18:21:44,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:44,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:44,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:21:44,877 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:44,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1638476478, now seen corresponding path program 2 times [2023-08-26 18:21:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840933873] [2023-08-26 18:21:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:46,100 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 18:21:46,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:46,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840933873] [2023-08-26 18:21:46,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840933873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:46,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:46,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:21:46,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693815635] [2023-08-26 18:21:46,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:46,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:21:46,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:46,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:21:46,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:21:46,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 341 [2023-08-26 18:21:46,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 350 transitions, 5203 flow. Second operand has 9 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 states have internal predecessors, (825), 0 states have call successors, (0), 0 states 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 18:21:46,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:46,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 341 [2023-08-26 18:21:46,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:21:52,115 INFO L124 PetriNetUnfolderBase]: 19356/32015 cut-off events. [2023-08-26 18:21:52,115 INFO L125 PetriNetUnfolderBase]: For 229102/229354 co-relation queries the response was YES. [2023-08-26 18:21:52,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184376 conditions, 32015 events. 19356/32015 cut-off events. For 229102/229354 co-relation queries the response was YES. Maximal size of possible extension queue 2378. Compared 277044 event pairs, 4170 based on Foata normal form. 794/32186 useless extension candidates. Maximal degree in co-relation 184336. Up to 11053 conditions per place. [2023-08-26 18:21:52,408 INFO L140 encePairwiseOnDemand]: 321/341 looper letters, 155 selfloop transitions, 373 changer transitions 160/691 dead transitions. [2023-08-26 18:21:52,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 691 transitions, 11592 flow [2023-08-26 18:21:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 18:21:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 18:21:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1422 transitions. [2023-08-26 18:21:52,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29786342689568496 [2023-08-26 18:21:52,415 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1422 transitions. [2023-08-26 18:21:52,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1422 transitions. [2023-08-26 18:21:52,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:21:52,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1422 transitions. [2023-08-26 18:21:52,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 101.57142857142857) internal successors, (1422), 14 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states 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 18:21:52,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states 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 18:21:52,424 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states 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 18:21:52,424 INFO L175 Difference]: Start difference. First operand has 122 places, 350 transitions, 5203 flow. Second operand 14 states and 1422 transitions. [2023-08-26 18:21:52,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 691 transitions, 11592 flow [2023-08-26 18:21:55,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 691 transitions, 11565 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-26 18:21:55,767 INFO L231 Difference]: Finished difference. Result has 140 places, 444 transitions, 7901 flow [2023-08-26 18:21:55,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=5186, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7901, PETRI_PLACES=140, PETRI_TRANSITIONS=444} [2023-08-26 18:21:55,768 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 43 predicate places. [2023-08-26 18:21:55,768 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 444 transitions, 7901 flow [2023-08-26 18:21:55,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 states have internal predecessors, (825), 0 states have call successors, (0), 0 states 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 18:21:55,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:21:55,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:21:55,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:21:55,769 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:21:55,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:21:55,769 INFO L85 PathProgramCache]: Analyzing trace with hash 21900208, now seen corresponding path program 1 times [2023-08-26 18:21:55,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:21:55,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532564503] [2023-08-26 18:21:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:21:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:21:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:21:56,154 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 18:21:56,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:21:56,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532564503] [2023-08-26 18:21:56,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532564503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:21:56,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:21:56,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:21:56,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411261310] [2023-08-26 18:21:56,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:21:56,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:21:56,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:21:56,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:21:56,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:21:56,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 341 [2023-08-26 18:21:56,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 444 transitions, 7901 flow. Second operand has 9 states, 9 states have (on average 94.66666666666667) internal successors, (852), 9 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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 18:21:56,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:21:56,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 341 [2023-08-26 18:21:56,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:00,658 INFO L124 PetriNetUnfolderBase]: 13514/22211 cut-off events. [2023-08-26 18:22:00,658 INFO L125 PetriNetUnfolderBase]: For 203235/203458 co-relation queries the response was YES. [2023-08-26 18:22:00,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135131 conditions, 22211 events. 13514/22211 cut-off events. For 203235/203458 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 179275 event pairs, 2695 based on Foata normal form. 901/22994 useless extension candidates. Maximal degree in co-relation 135085. Up to 11078 conditions per place. [2023-08-26 18:22:00,819 INFO L140 encePairwiseOnDemand]: 328/341 looper letters, 104 selfloop transitions, 16 changer transitions 434/556 dead transitions. [2023-08-26 18:22:00,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 556 transitions, 10603 flow [2023-08-26 18:22:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:22:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:22:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 815 transitions. [2023-08-26 18:22:00,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2987536656891496 [2023-08-26 18:22:00,821 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 815 transitions. [2023-08-26 18:22:00,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 815 transitions. [2023-08-26 18:22:00,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:00,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 815 transitions. [2023-08-26 18:22:00,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 0 states 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 18:22:00,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states 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 18:22:00,825 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states 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 18:22:00,825 INFO L175 Difference]: Start difference. First operand has 140 places, 444 transitions, 7901 flow. Second operand 8 states and 815 transitions. [2023-08-26 18:22:00,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 556 transitions, 10603 flow [2023-08-26 18:22:04,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 556 transitions, 10095 flow, removed 157 selfloop flow, removed 5 redundant places. [2023-08-26 18:22:04,224 INFO L231 Difference]: Finished difference. Result has 135 places, 101 transitions, 1514 flow [2023-08-26 18:22:04,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=7337, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1514, PETRI_PLACES=135, PETRI_TRANSITIONS=101} [2023-08-26 18:22:04,225 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 38 predicate places. [2023-08-26 18:22:04,225 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 101 transitions, 1514 flow [2023-08-26 18:22:04,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.66666666666667) internal successors, (852), 9 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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 18:22:04,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:04,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:04,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:22:04,226 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:22:04,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1613445460, now seen corresponding path program 1 times [2023-08-26 18:22:04,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:04,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558552236] [2023-08-26 18:22:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:04,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:04,400 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 18:22:04,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:04,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558552236] [2023-08-26 18:22:04,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558552236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:04,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:04,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:22:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431631907] [2023-08-26 18:22:04,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:04,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:22:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:22:04,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:22:04,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 341 [2023-08-26 18:22:04,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 101 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 18:22:04,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:04,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 341 [2023-08-26 18:22:04,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:04,735 INFO L124 PetriNetUnfolderBase]: 909/1689 cut-off events. [2023-08-26 18:22:04,736 INFO L125 PetriNetUnfolderBase]: For 20832/21009 co-relation queries the response was YES. [2023-08-26 18:22:04,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9914 conditions, 1689 events. 909/1689 cut-off events. For 20832/21009 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10239 event pairs, 165 based on Foata normal form. 102/1752 useless extension candidates. Maximal degree in co-relation 9871. Up to 1287 conditions per place. [2023-08-26 18:22:04,746 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 100 selfloop transitions, 4 changer transitions 3/141 dead transitions. [2023-08-26 18:22:04,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 141 transitions, 2202 flow [2023-08-26 18:22:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:22:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:22:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-26 18:22:04,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38514173998044965 [2023-08-26 18:22:04,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-26 18:22:04,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-26 18:22:04,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:04,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-26 18:22:04,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states 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 18:22:04,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:22:04,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 18:22:04,749 INFO L175 Difference]: Start difference. First operand has 135 places, 101 transitions, 1514 flow. Second operand 3 states and 394 transitions. [2023-08-26 18:22:04,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 141 transitions, 2202 flow [2023-08-26 18:22:04,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 141 transitions, 1911 flow, removed 60 selfloop flow, removed 20 redundant places. [2023-08-26 18:22:04,771 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 1244 flow [2023-08-26 18:22:04,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1244, PETRI_PLACES=92, PETRI_TRANSITIONS=99} [2023-08-26 18:22:04,771 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -5 predicate places. [2023-08-26 18:22:04,771 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 1244 flow [2023-08-26 18:22:04,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 18:22:04,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:04,771 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 18:22:04,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 18:22:04,771 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:22:04,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:04,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2016653068, now seen corresponding path program 1 times [2023-08-26 18:22:04,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538477967] [2023-08-26 18:22:04,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:06,308 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 18:22:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:06,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538477967] [2023-08-26 18:22:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538477967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:06,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:06,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 18:22:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629087332] [2023-08-26 18:22:06,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:06,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 18:22:06,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:06,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 18:22:06,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-26 18:22:06,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 341 [2023-08-26 18:22:06,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 99 transitions, 1244 flow. Second operand has 11 states, 11 states have (on average 85.54545454545455) internal successors, (941), 11 states have internal predecessors, (941), 0 states have call successors, (0), 0 states 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 18:22:06,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:06,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 341 [2023-08-26 18:22:06,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:06,793 INFO L124 PetriNetUnfolderBase]: 1050/1859 cut-off events. [2023-08-26 18:22:06,793 INFO L125 PetriNetUnfolderBase]: For 16243/16255 co-relation queries the response was YES. [2023-08-26 18:22:06,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10897 conditions, 1859 events. 1050/1859 cut-off events. For 16243/16255 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10509 event pairs, 285 based on Foata normal form. 5/1844 useless extension candidates. Maximal degree in co-relation 10867. Up to 877 conditions per place. [2023-08-26 18:22:06,802 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 73 selfloop transitions, 42 changer transitions 0/117 dead transitions. [2023-08-26 18:22:06,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 117 transitions, 1586 flow [2023-08-26 18:22:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:22:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:22:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2023-08-26 18:22:06,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2635106828655216 [2023-08-26 18:22:06,804 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2023-08-26 18:22:06,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2023-08-26 18:22:06,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:06,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2023-08-26 18:22:06,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 0 states 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 18:22:06,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states 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 18:22:06,806 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states 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 18:22:06,807 INFO L175 Difference]: Start difference. First operand has 92 places, 99 transitions, 1244 flow. Second operand 7 states and 629 transitions. [2023-08-26 18:22:06,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 117 transitions, 1586 flow [2023-08-26 18:22:06,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 117 transitions, 1558 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-26 18:22:06,818 INFO L231 Difference]: Finished difference. Result has 97 places, 99 transitions, 1341 flow [2023-08-26 18:22:06,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1341, PETRI_PLACES=97, PETRI_TRANSITIONS=99} [2023-08-26 18:22:06,819 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2023-08-26 18:22:06,819 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 99 transitions, 1341 flow [2023-08-26 18:22:06,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.54545454545455) internal successors, (941), 11 states have internal predecessors, (941), 0 states have call successors, (0), 0 states 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 18:22:06,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:06,819 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 18:22:06,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 18:22:06,819 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:22:06,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 257530005, now seen corresponding path program 1 times [2023-08-26 18:22:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589441015] [2023-08-26 18:22:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:06,989 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 18:22:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:06,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589441015] [2023-08-26 18:22:06,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589441015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:06,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:06,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:22:06,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411116167] [2023-08-26 18:22:06,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:06,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:22:06,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:06,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:22:06,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:22:06,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 341 [2023-08-26 18:22:06,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 1341 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states 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 18:22:06,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:06,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 341 [2023-08-26 18:22:06,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:07,173 INFO L124 PetriNetUnfolderBase]: 475/992 cut-off events. [2023-08-26 18:22:07,174 INFO L125 PetriNetUnfolderBase]: For 7622/7678 co-relation queries the response was YES. [2023-08-26 18:22:07,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5439 conditions, 992 events. 475/992 cut-off events. For 7622/7678 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5872 event pairs, 53 based on Foata normal form. 124/1095 useless extension candidates. Maximal degree in co-relation 5409. Up to 360 conditions per place. [2023-08-26 18:22:07,179 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 108 selfloop transitions, 7 changer transitions 3/148 dead transitions. [2023-08-26 18:22:07,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 148 transitions, 2101 flow [2023-08-26 18:22:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:22:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:22:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-26 18:22:07,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3841642228739003 [2023-08-26 18:22:07,181 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-26 18:22:07,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-26 18:22:07,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:07,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-26 18:22:07,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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 18:22:07,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states 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 18:22:07,183 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states 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 18:22:07,183 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 1341 flow. Second operand 4 states and 524 transitions. [2023-08-26 18:22:07,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 148 transitions, 2101 flow [2023-08-26 18:22:07,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 148 transitions, 1898 flow, removed 16 selfloop flow, removed 12 redundant places. [2023-08-26 18:22:07,192 INFO L231 Difference]: Finished difference. Result has 89 places, 96 transitions, 1134 flow [2023-08-26 18:22:07,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1134, PETRI_PLACES=89, PETRI_TRANSITIONS=96} [2023-08-26 18:22:07,192 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -8 predicate places. [2023-08-26 18:22:07,192 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 96 transitions, 1134 flow [2023-08-26 18:22:07,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states 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 18:22:07,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:07,193 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] [2023-08-26 18:22:07,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 18:22:07,193 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:22:07,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash -102729529, now seen corresponding path program 1 times [2023-08-26 18:22:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:07,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454944379] [2023-08-26 18:22:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:07,373 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 18:22:07,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:07,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454944379] [2023-08-26 18:22:07,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454944379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:07,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:07,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:22:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224741528] [2023-08-26 18:22:07,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:07,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:22:07,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:07,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:22:07,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:22:07,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 341 [2023-08-26 18:22:07,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 96 transitions, 1134 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 18:22:07,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:07,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 341 [2023-08-26 18:22:07,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:07,553 INFO L124 PetriNetUnfolderBase]: 401/829 cut-off events. [2023-08-26 18:22:07,553 INFO L125 PetriNetUnfolderBase]: For 5267/5315 co-relation queries the response was YES. [2023-08-26 18:22:07,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4700 conditions, 829 events. 401/829 cut-off events. For 5267/5315 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4866 event pairs, 44 based on Foata normal form. 58/869 useless extension candidates. Maximal degree in co-relation 4674. Up to 358 conditions per place. [2023-08-26 18:22:07,557 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 57 selfloop transitions, 10 changer transitions 69/148 dead transitions. [2023-08-26 18:22:07,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 148 transitions, 1926 flow [2023-08-26 18:22:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:22:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:22:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-26 18:22:07,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37771260997067446 [2023-08-26 18:22:07,559 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-26 18:22:07,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-26 18:22:07,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:07,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-26 18:22:07,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 18:22:07,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states 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 18:22:07,562 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states 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 18:22:07,562 INFO L175 Difference]: Start difference. First operand has 89 places, 96 transitions, 1134 flow. Second operand 5 states and 644 transitions. [2023-08-26 18:22:07,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 148 transitions, 1926 flow [2023-08-26 18:22:07,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 148 transitions, 1747 flow, removed 32 selfloop flow, removed 7 redundant places. [2023-08-26 18:22:07,569 INFO L231 Difference]: Finished difference. Result has 87 places, 53 transitions, 532 flow [2023-08-26 18:22:07,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=532, PETRI_PLACES=87, PETRI_TRANSITIONS=53} [2023-08-26 18:22:07,569 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -10 predicate places. [2023-08-26 18:22:07,569 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 532 flow [2023-08-26 18:22:07,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 18:22:07,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:07,570 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] [2023-08-26 18:22:07,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 18:22:07,570 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 18:22:07,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash -169700026, now seen corresponding path program 1 times [2023-08-26 18:22:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:07,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719376485] [2023-08-26 18:22:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:07,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:22:07,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:22:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:22:07,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:22:07,743 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:22:07,744 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (99 of 100 remaining) [2023-08-26 18:22:07,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 100 remaining) [2023-08-26 18:22:07,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 100 remaining) [2023-08-26 18:22:07,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 100 remaining) [2023-08-26 18:22:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 100 remaining) [2023-08-26 18:22:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 100 remaining) [2023-08-26 18:22:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 100 remaining) [2023-08-26 18:22:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 100 remaining) [2023-08-26 18:22:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 100 remaining) [2023-08-26 18:22:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 100 remaining) [2023-08-26 18:22:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 100 remaining) [2023-08-26 18:22:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 100 remaining) [2023-08-26 18:22:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 100 remaining) [2023-08-26 18:22:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 100 remaining) [2023-08-26 18:22:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 100 remaining) [2023-08-26 18:22:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 100 remaining) [2023-08-26 18:22:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 100 remaining) [2023-08-26 18:22:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 100 remaining) [2023-08-26 18:22:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 100 remaining) [2023-08-26 18:22:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 100 remaining) [2023-08-26 18:22:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 100 remaining) [2023-08-26 18:22:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 100 remaining) [2023-08-26 18:22:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 100 remaining) [2023-08-26 18:22:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 100 remaining) [2023-08-26 18:22:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 100 remaining) [2023-08-26 18:22:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 100 remaining) [2023-08-26 18:22:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 100 remaining) [2023-08-26 18:22:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 100 remaining) [2023-08-26 18:22:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 100 remaining) [2023-08-26 18:22:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 100 remaining) [2023-08-26 18:22:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 100 remaining) [2023-08-26 18:22:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 100 remaining) [2023-08-26 18:22:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 100 remaining) [2023-08-26 18:22:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 100 remaining) [2023-08-26 18:22:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 100 remaining) [2023-08-26 18:22:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 100 remaining) [2023-08-26 18:22:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 100 remaining) [2023-08-26 18:22:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 100 remaining) [2023-08-26 18:22:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 100 remaining) [2023-08-26 18:22:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 100 remaining) [2023-08-26 18:22:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 100 remaining) [2023-08-26 18:22:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 100 remaining) [2023-08-26 18:22:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 100 remaining) [2023-08-26 18:22:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 100 remaining) [2023-08-26 18:22:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 100 remaining) [2023-08-26 18:22:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 100 remaining) [2023-08-26 18:22:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 100 remaining) [2023-08-26 18:22:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 100 remaining) [2023-08-26 18:22:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 100 remaining) [2023-08-26 18:22:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 100 remaining) [2023-08-26 18:22:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 100 remaining) [2023-08-26 18:22:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 100 remaining) [2023-08-26 18:22:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 100 remaining) [2023-08-26 18:22:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 100 remaining) [2023-08-26 18:22:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 100 remaining) [2023-08-26 18:22:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 100 remaining) [2023-08-26 18:22:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 100 remaining) [2023-08-26 18:22:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 100 remaining) [2023-08-26 18:22:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 100 remaining) [2023-08-26 18:22:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 100 remaining) [2023-08-26 18:22:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 100 remaining) [2023-08-26 18:22:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 100 remaining) [2023-08-26 18:22:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 100 remaining) [2023-08-26 18:22:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 100 remaining) [2023-08-26 18:22:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 100 remaining) [2023-08-26 18:22:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 100 remaining) [2023-08-26 18:22:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 100 remaining) [2023-08-26 18:22:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 100 remaining) [2023-08-26 18:22:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 100 remaining) [2023-08-26 18:22:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 100 remaining) [2023-08-26 18:22:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 100 remaining) [2023-08-26 18:22:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 100 remaining) [2023-08-26 18:22:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 100 remaining) [2023-08-26 18:22:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 100 remaining) [2023-08-26 18:22:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 100 remaining) [2023-08-26 18:22:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 100 remaining) [2023-08-26 18:22:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 100 remaining) [2023-08-26 18:22:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 100 remaining) [2023-08-26 18:22:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 100 remaining) [2023-08-26 18:22:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 100 remaining) [2023-08-26 18:22:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 100 remaining) [2023-08-26 18:22:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 100 remaining) [2023-08-26 18:22:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 100 remaining) [2023-08-26 18:22:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 100 remaining) [2023-08-26 18:22:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 100 remaining) [2023-08-26 18:22:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 100 remaining) [2023-08-26 18:22:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 100 remaining) [2023-08-26 18:22:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 100 remaining) [2023-08-26 18:22:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 100 remaining) [2023-08-26 18:22:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 100 remaining) [2023-08-26 18:22:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 100 remaining) [2023-08-26 18:22:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 100 remaining) [2023-08-26 18:22:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 100 remaining) [2023-08-26 18:22:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 100 remaining) [2023-08-26 18:22:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 100 remaining) [2023-08-26 18:22:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 100 remaining) [2023-08-26 18:22:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 100 remaining) [2023-08-26 18:22:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 100 remaining) [2023-08-26 18:22:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 100 remaining) [2023-08-26 18:22:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 100 remaining) [2023-08-26 18:22:07,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 18:22:07,762 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:07,768 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:22:07,768 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:22:07,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:22:07 BasicIcfg [2023-08-26 18:22:07,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:22:07,863 INFO L158 Benchmark]: Toolchain (without parser) took 100234.21ms. Allocated memory was 369.1MB in the beginning and 8.2GB in the end (delta: 7.9GB). Free memory was 344.8MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-26 18:22:07,863 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 369.1MB. Free memory was 347.3MB in the beginning and 347.2MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:22:07,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.40ms. Allocated memory is still 369.1MB. Free memory was 344.1MB in the beginning and 317.6MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 18:22:07,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.37ms. Allocated memory is still 369.1MB. Free memory was 317.6MB in the beginning and 314.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 18:22:07,864 INFO L158 Benchmark]: Boogie Preprocessor took 46.55ms. Allocated memory is still 369.1MB. Free memory was 314.7MB in the beginning and 312.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:22:07,864 INFO L158 Benchmark]: RCFGBuilder took 1480.44ms. Allocated memory was 369.1MB in the beginning and 545.3MB in the end (delta: 176.2MB). Free memory was 312.6MB in the beginning and 447.3MB in the end (delta: -134.6MB). Peak memory consumption was 72.6MB. Max. memory is 16.0GB. [2023-08-26 18:22:07,864 INFO L158 Benchmark]: TraceAbstraction took 98010.14ms. Allocated memory was 545.3MB in the beginning and 8.2GB in the end (delta: 7.7GB). Free memory was 447.3MB in the beginning and 5.6GB in the end (delta: -5.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-26 18:22:07,865 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.15ms. Allocated memory is still 369.1MB. Free memory was 347.3MB in the beginning and 347.2MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 615.40ms. Allocated memory is still 369.1MB. Free memory was 344.1MB in the beginning and 317.6MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 76.37ms. Allocated memory is still 369.1MB. Free memory was 317.6MB in the beginning and 314.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.55ms. Allocated memory is still 369.1MB. Free memory was 314.7MB in the beginning and 312.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1480.44ms. Allocated memory was 369.1MB in the beginning and 545.3MB in the end (delta: 176.2MB). Free memory was 312.6MB in the beginning and 447.3MB in the end (delta: -134.6MB). Peak memory consumption was 72.6MB. Max. memory is 16.0GB. * TraceAbstraction took 98010.14ms. Allocated memory was 545.3MB in the beginning and 8.2GB in the end (delta: 7.7GB). Free memory was 447.3MB in the beginning and 5.6GB in the end (delta: -5.2GB). Peak memory consumption was 2.5GB. 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: 19.3s, 192 PlacesBefore, 97 PlacesAfterwards, 185 TransitionsBefore, 88 TransitionsAfterwards, 8612 CoEnabledTransitionPairs, 7 FixpointIterations, 62 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 153 TotalNumberOfCompositions, 44570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10000, independent: 9303, independent conditional: 0, independent unconditional: 9303, dependent: 697, dependent conditional: 0, dependent unconditional: 697, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3178, independent: 3059, independent conditional: 0, independent unconditional: 3059, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10000, independent: 6244, independent conditional: 0, independent unconditional: 6244, dependent: 578, dependent conditional: 0, dependent unconditional: 578, unknown: 3178, unknown conditional: 0, unknown unconditional: 3178] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 429, Positive conditional cache size: 0, Positive unconditional cache size: 429, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1813; [L851] FCALL, FORK 0 pthread_create(&t1813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1813, ((void *)0), P0, ((void *)0))=-1, t1813={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] EXPR 1 \read(y) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L771] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L772] EXPR 1 \read(y) [L772] 1 __unbuffered_p0_EAX = y [L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L773] 1 y = y$flush_delayed ? y$mem_tmp : y [L774] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L852] 0 pthread_t t1814; [L853] FCALL, FORK 0 pthread_create(&t1814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1814, ((void *)0), P1, ((void *)0))=0, t1813={6:0}, t1814={7:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1815; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1813={6:0}, t1814={7:0}, t1815={5:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L777] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L789] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_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, pthread_create(&t1815, ((void *)0), P2, ((void *)0))=1, t1813={6:0}, t1814={7:0}, t1815={5:0}, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 y$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(y) [L812] 3 y$mem_tmp = y [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] EXPR 3 \read(y) [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L815] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L816] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L817] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L819] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_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$$choice1=0, weak$$choice2=255, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 \read(y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_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$$choice1=0, weak$$choice2=255, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L825] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_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$$choice1=0, weak$$choice2=255, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] 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) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] 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) [L828] 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) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 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 [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_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$$choice1=0, weak$$choice2=255, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] 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) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1813={6:0}, t1814={7:0}, t1815={5:0}, weak$$choice1=0, weak$$choice2=255, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 y$flush_delayed = weak$$choice2 [L871] EXPR 0 \read(y) [L871] 0 y$mem_tmp = y [L872] 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) [L872] EXPR 0 \read(y) [L872] 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) [L872] 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) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L880] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L880] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L880] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L880] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 x == 2 && y == 2 [L881] EXPR 0 \read(y) [L881] EXPR 0 x == 2 && y == 2 [L881] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L882] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L882] EXPR 0 \read(y) [L882] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L882] 0 y = y$flush_delayed ? y$mem_tmp : y [L883] 0 y$flush_delayed = (_Bool)0 [L885] 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", "safe001_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 853]: 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: 851]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 248 locations, 100 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: 97.7s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 64.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1059 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1059 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2615 IncrementalHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 31 mSDtfsCounter, 2615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7901occurred in iteration=19, InterpolantAutomatonStates: 130, 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.6s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 3468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 18:22:07,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...