/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:13:03,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:13:03,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:13:03,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:13:03,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:13:03,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:13:03,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:13:03,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:13:03,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:13:03,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:13:03,262 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:13:03,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:13:03,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:13:03,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:13:03,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:13:03,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:13:03,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:13:03,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:13:03,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:13:03,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:13:03,264 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:13:03,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:13:03,265 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:13:03,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:13:03,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:13:03,266 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:13:03,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:13:03,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:13:03,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:13:03,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:13:03,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:13:03,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:13:03,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:13:03,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:13:03,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:13:03,268 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:13:03,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:13:03,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:13:03,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:13:03,550 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:13:03,550 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:13:03,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2023-08-26 12:13:04,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:13:04,841 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:13:04,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2023-08-26 12:13:04,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbae07c74/7375108cbdd94920ac227199a2a26229/FLAGea33216c6 [2023-08-26 12:13:04,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbae07c74/7375108cbdd94920ac227199a2a26229 [2023-08-26 12:13:04,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:13:04,865 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:13:04,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:13:04,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:13:04,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:13:04,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:13:04" (1/1) ... [2023-08-26 12:13:04,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cdaa1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:04, skipping insertion in model container [2023-08-26 12:13:04,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:13:04" (1/1) ... [2023-08-26 12:13:04,915 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:13:05,222 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:13:05,229 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:13:05,240 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:13:05,241 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:13:05,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:13:05,278 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:13:05,278 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:13:05,283 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:13:05,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05 WrapperNode [2023-08-26 12:13:05,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:13:05,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:13:05,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:13:05,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:13:05,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,311 INFO L138 Inliner]: procedures = 176, calls = 68, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-08-26 12:13:05,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:13:05,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:13:05,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:13:05,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:13:05,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:13:05,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:13:05,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:13:05,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:13:05,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (1/1) ... [2023-08-26 12:13:05,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:13:05,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:13:05,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:13:05,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:13:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:13:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:13:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:13:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:13:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:13:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:13:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:13:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:13:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:13:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:13:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:13:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:13:05,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:13:05,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:13:05,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:13:05,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:13:05,410 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:13:05,513 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:13:05,514 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:13:05,880 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:13:06,084 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:13:06,084 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:13:06,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:13:06 BoogieIcfgContainer [2023-08-26 12:13:06,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:13:06,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:13:06,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:13:06,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:13:06,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:13:04" (1/3) ... [2023-08-26 12:13:06,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447d7212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:13:06, skipping insertion in model container [2023-08-26 12:13:06,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:13:05" (2/3) ... [2023-08-26 12:13:06,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447d7212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:13:06, skipping insertion in model container [2023-08-26 12:13:06,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:13:06" (3/3) ... [2023-08-26 12:13:06,093 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2023-08-26 12:13:06,108 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:13:06,108 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-08-26 12:13:06,108 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:13:06,187 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:13:06,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 158 transitions, 331 flow [2023-08-26 12:13:06,298 INFO L124 PetriNetUnfolderBase]: 3/155 cut-off events. [2023-08-26 12:13:06,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:13:06,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 155 events. 3/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 189 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 12:13:06,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 158 transitions, 331 flow [2023-08-26 12:13:06,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 155 transitions, 319 flow [2023-08-26 12:13:06,315 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:13:06,325 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 155 transitions, 319 flow [2023-08-26 12:13:06,328 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 155 transitions, 319 flow [2023-08-26 12:13:06,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 155 transitions, 319 flow [2023-08-26 12:13:06,370 INFO L124 PetriNetUnfolderBase]: 3/155 cut-off events. [2023-08-26 12:13:06,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:13:06,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 155 events. 3/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 189 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 12:13:06,375 INFO L119 LiptonReduction]: Number of co-enabled transitions 4482 [2023-08-26 12:13:12,786 INFO L134 LiptonReduction]: Checked pairs total: 18229 [2023-08-26 12:13:12,787 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-26 12:13:12,800 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:13:12,805 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;@20ecf8fe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:13:12,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-08-26 12:13:12,806 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:13:12,806 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:13:12,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:13:12,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:12,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:13:12,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:12,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash 789, now seen corresponding path program 1 times [2023-08-26 12:13:12,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:12,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496301367] [2023-08-26 12:13:12,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:12,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:12,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:12,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496301367] [2023-08-26 12:13:12,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496301367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:12,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:12,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:13:12,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361428224] [2023-08-26 12:13:12,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:12,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:13:12,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:12,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:13:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:13:12,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 298 [2023-08-26 12:13:12,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 127 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:12,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:12,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 298 [2023-08-26 12:13:12,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:13,583 INFO L124 PetriNetUnfolderBase]: 4056/6058 cut-off events. [2023-08-26 12:13:13,583 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-26 12:13:13,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11962 conditions, 6058 events. 4056/6058 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 38246 event pairs, 4056 based on Foata normal form. 0/3307 useless extension candidates. Maximal degree in co-relation 11951. Up to 5858 conditions per place. [2023-08-26 12:13:13,610 INFO L140 encePairwiseOnDemand]: 280/298 looper letters, 33 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-26 12:13:13,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 153 flow [2023-08-26 12:13:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:13:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:13:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 301 transitions. [2023-08-26 12:13:13,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050335570469798 [2023-08-26 12:13:13,623 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 301 transitions. [2023-08-26 12:13:13,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 301 transitions. [2023-08-26 12:13:13,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:13,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 301 transitions. [2023-08-26 12:13:13,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 150.5) internal successors, (301), 2 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:13,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 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 12:13:13,632 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 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 12:13:13,633 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 127 flow. Second operand 2 states and 301 transitions. [2023-08-26 12:13:13,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 153 flow [2023-08-26 12:13:13,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:13:13,637 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 84 flow [2023-08-26 12:13:13,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-26 12:13:13,640 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2023-08-26 12:13:13,640 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 84 flow [2023-08-26 12:13:13,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:13,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:13,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:13:13,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:13:13,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:13,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash 779009, now seen corresponding path program 1 times [2023-08-26 12:13:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:13,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492293075] [2023-08-26 12:13:13,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:13,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:13,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:13,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492293075] [2023-08-26 12:13:13,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492293075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:13,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:13,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:13:13,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149859649] [2023-08-26 12:13:13,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:13,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:13:13,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:13,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:13:13,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:13:13,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 298 [2023-08-26 12:13:13,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:13,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:13,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 298 [2023-08-26 12:13:13,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:14,308 INFO L124 PetriNetUnfolderBase]: 3586/5390 cut-off events. [2023-08-26 12:13:14,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:13:14,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10754 conditions, 5390 events. 3586/5390 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 31659 event pairs, 2503 based on Foata normal form. 0/3732 useless extension candidates. Maximal degree in co-relation 10751. Up to 3692 conditions per place. [2023-08-26 12:13:14,333 INFO L140 encePairwiseOnDemand]: 285/298 looper letters, 42 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-26 12:13:14,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 206 flow [2023-08-26 12:13:14,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:13:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:13:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-26 12:13:14,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105145413870246 [2023-08-26 12:13:14,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-26 12:13:14,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-26 12:13:14,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:14,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-26 12:13:14,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:14,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:14,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:14,338 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 84 flow. Second operand 3 states and 367 transitions. [2023-08-26 12:13:14,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 206 flow [2023-08-26 12:13:14,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:13:14,339 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 136 flow [2023-08-26 12:13:14,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-26 12:13:14,340 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-08-26 12:13:14,340 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 136 flow [2023-08-26 12:13:14,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:14,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:14,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:13:14,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:13:14,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:14,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 779010, now seen corresponding path program 1 times [2023-08-26 12:13:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:14,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675148391] [2023-08-26 12:13:14,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:14,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:14,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675148391] [2023-08-26 12:13:14,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675148391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:14,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:14,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:13:14,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132692414] [2023-08-26 12:13:14,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:14,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:13:14,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:14,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:13:14,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:13:14,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 298 [2023-08-26 12:13:14,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:14,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:14,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 298 [2023-08-26 12:13:14,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:14,683 INFO L124 PetriNetUnfolderBase]: 1489/2370 cut-off events. [2023-08-26 12:13:14,683 INFO L125 PetriNetUnfolderBase]: For 605/614 co-relation queries the response was YES. [2023-08-26 12:13:14,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6005 conditions, 2370 events. 1489/2370 cut-off events. For 605/614 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 13225 event pairs, 1276 based on Foata normal form. 336/2531 useless extension candidates. Maximal degree in co-relation 6000. Up to 2282 conditions per place. [2023-08-26 12:13:14,696 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 32 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2023-08-26 12:13:14,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 190 flow [2023-08-26 12:13:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:13:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:13:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-26 12:13:14,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4004474272930649 [2023-08-26 12:13:14,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-26 12:13:14,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-26 12:13:14,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:14,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-26 12:13:14,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:14,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:14,701 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:14,701 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 136 flow. Second operand 3 states and 358 transitions. [2023-08-26 12:13:14,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 190 flow [2023-08-26 12:13:14,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:14,708 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 112 flow [2023-08-26 12:13:14,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-26 12:13:14,709 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -24 predicate places. [2023-08-26 12:13:14,709 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 112 flow [2023-08-26 12:13:14,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:14,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:14,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:14,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:13:14,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:14,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:14,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1864683857, now seen corresponding path program 1 times [2023-08-26 12:13:14,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:14,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581986108] [2023-08-26 12:13:14,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:14,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:14,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:14,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581986108] [2023-08-26 12:13:14,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581986108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:14,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:14,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:13:14,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353687906] [2023-08-26 12:13:14,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:14,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:13:14,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:14,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:13:14,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:13:14,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 298 [2023-08-26 12:13:14,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:14,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:14,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 298 [2023-08-26 12:13:14,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:15,111 INFO L124 PetriNetUnfolderBase]: 1280/2131 cut-off events. [2023-08-26 12:13:15,112 INFO L125 PetriNetUnfolderBase]: For 308/326 co-relation queries the response was YES. [2023-08-26 12:13:15,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 2131 events. 1280/2131 cut-off events. For 308/326 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12519 event pairs, 265 based on Foata normal form. 9/1854 useless extension candidates. Maximal degree in co-relation 5057. Up to 1634 conditions per place. [2023-08-26 12:13:15,124 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 42 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-26 12:13:15,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 244 flow [2023-08-26 12:13:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:13:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:13:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-26 12:13:15,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4552572706935123 [2023-08-26 12:13:15,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-26 12:13:15,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-26 12:13:15,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:15,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-26 12:13:15,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,128 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 112 flow. Second operand 3 states and 407 transitions. [2023-08-26 12:13:15,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 244 flow [2023-08-26 12:13:15,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:13:15,130 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 119 flow [2023-08-26 12:13:15,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 12:13:15,131 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-08-26 12:13:15,131 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 119 flow [2023-08-26 12:13:15,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:15,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:15,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:13:15,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:15,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1864684035, now seen corresponding path program 1 times [2023-08-26 12:13:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:15,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338051617] [2023-08-26 12:13:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338051617] [2023-08-26 12:13:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338051617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:15,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:15,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:13:15,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883054062] [2023-08-26 12:13:15,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:15,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:13:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:15,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:13:15,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:13:15,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 298 [2023-08-26 12:13:15,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:15,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 298 [2023-08-26 12:13:15,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:15,401 INFO L124 PetriNetUnfolderBase]: 1269/2088 cut-off events. [2023-08-26 12:13:15,401 INFO L125 PetriNetUnfolderBase]: For 421/466 co-relation queries the response was YES. [2023-08-26 12:13:15,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5190 conditions, 2088 events. 1269/2088 cut-off events. For 421/466 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 11862 event pairs, 740 based on Foata normal form. 9/1835 useless extension candidates. Maximal degree in co-relation 5184. Up to 1342 conditions per place. [2023-08-26 12:13:15,410 INFO L140 encePairwiseOnDemand]: 294/298 looper letters, 46 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-26 12:13:15,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 286 flow [2023-08-26 12:13:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:13:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:13:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-26 12:13:15,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4664429530201342 [2023-08-26 12:13:15,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-26 12:13:15,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-26 12:13:15,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:15,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-26 12:13:15,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,414 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 119 flow. Second operand 3 states and 417 transitions. [2023-08-26 12:13:15,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 286 flow [2023-08-26 12:13:15,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:15,416 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 128 flow [2023-08-26 12:13:15,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-26 12:13:15,416 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-26 12:13:15,417 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 128 flow [2023-08-26 12:13:15,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:15,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:15,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:13:15,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:15,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1400003396, now seen corresponding path program 1 times [2023-08-26 12:13:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:15,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451631419] [2023-08-26 12:13:15,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:15,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451631419] [2023-08-26 12:13:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451631419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:15,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:15,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:13:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568339614] [2023-08-26 12:13:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:15,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:13:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:13:15,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:13:15,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 298 [2023-08-26 12:13:15,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:15,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 298 [2023-08-26 12:13:15,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:15,719 INFO L124 PetriNetUnfolderBase]: 1479/2409 cut-off events. [2023-08-26 12:13:15,719 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2023-08-26 12:13:15,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6289 conditions, 2409 events. 1479/2409 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 13808 event pairs, 572 based on Foata normal form. 0/2300 useless extension candidates. Maximal degree in co-relation 6282. Up to 1347 conditions per place. [2023-08-26 12:13:15,728 INFO L140 encePairwiseOnDemand]: 293/298 looper letters, 48 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-26 12:13:15,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 287 flow [2023-08-26 12:13:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:13:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:13:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-26 12:13:15,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4004474272930649 [2023-08-26 12:13:15,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-26 12:13:15,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-26 12:13:15,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:15,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-26 12:13:15,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,732 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 128 flow. Second operand 3 states and 358 transitions. [2023-08-26 12:13:15,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 287 flow [2023-08-26 12:13:15,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:15,733 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 151 flow [2023-08-26 12:13:15,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-26 12:13:15,734 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-26 12:13:15,734 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 151 flow [2023-08-26 12:13:15,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:15,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:15,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:13:15,735 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:15,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:15,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1970626293, now seen corresponding path program 1 times [2023-08-26 12:13:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:15,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619926821] [2023-08-26 12:13:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619926821] [2023-08-26 12:13:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619926821] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:15,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:13:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316196382] [2023-08-26 12:13:15,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:15,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:13:15,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:15,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:13:15,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:13:15,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 298 [2023-08-26 12:13:15,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:15,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:15,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 298 [2023-08-26 12:13:15,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:16,082 INFO L124 PetriNetUnfolderBase]: 1357/2290 cut-off events. [2023-08-26 12:13:16,083 INFO L125 PetriNetUnfolderBase]: For 1239/1278 co-relation queries the response was YES. [2023-08-26 12:13:16,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6204 conditions, 2290 events. 1357/2290 cut-off events. For 1239/1278 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 13867 event pairs, 462 based on Foata normal form. 63/2244 useless extension candidates. Maximal degree in co-relation 6196. Up to 1441 conditions per place. [2023-08-26 12:13:16,092 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 54 selfloop transitions, 3 changer transitions 1/62 dead transitions. [2023-08-26 12:13:16,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 346 flow [2023-08-26 12:13:16,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:13:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:13:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-26 12:13:16,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39932885906040266 [2023-08-26 12:13:16,094 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-26 12:13:16,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-26 12:13:16,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:16,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-26 12:13:16,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:16,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:16,097 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:16,097 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 151 flow. Second operand 4 states and 476 transitions. [2023-08-26 12:13:16,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 346 flow [2023-08-26 12:13:16,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:16,105 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 145 flow [2023-08-26 12:13:16,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-26 12:13:16,105 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-26 12:13:16,105 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 145 flow [2023-08-26 12:13:16,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:16,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:16,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:16,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:13:16,106 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:16,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:16,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1970656837, now seen corresponding path program 1 times [2023-08-26 12:13:16,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:16,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807905107] [2023-08-26 12:13:16,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:16,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:16,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807905107] [2023-08-26 12:13:16,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807905107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:16,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:16,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:13:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251950892] [2023-08-26 12:13:16,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:16,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:13:16,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:16,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:13:16,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:13:16,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 298 [2023-08-26 12:13:16,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:16,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:16,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 298 [2023-08-26 12:13:16,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:16,674 INFO L124 PetriNetUnfolderBase]: 3576/5634 cut-off events. [2023-08-26 12:13:16,674 INFO L125 PetriNetUnfolderBase]: For 3767/4034 co-relation queries the response was YES. [2023-08-26 12:13:16,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15115 conditions, 5634 events. 3576/5634 cut-off events. For 3767/4034 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 34627 event pairs, 761 based on Foata normal form. 139/5419 useless extension candidates. Maximal degree in co-relation 15108. Up to 2628 conditions per place. [2023-08-26 12:13:16,692 INFO L140 encePairwiseOnDemand]: 294/298 looper letters, 71 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2023-08-26 12:13:16,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 466 flow [2023-08-26 12:13:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:13:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:13:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-26 12:13:16,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44798657718120805 [2023-08-26 12:13:16,693 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-26 12:13:16,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-26 12:13:16,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:16,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-26 12:13:16,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:16,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:16,696 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:16,696 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 145 flow. Second operand 4 states and 534 transitions. [2023-08-26 12:13:16,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 466 flow [2023-08-26 12:13:16,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:16,701 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 160 flow [2023-08-26 12:13:16,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-26 12:13:16,701 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-08-26 12:13:16,701 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 160 flow [2023-08-26 12:13:16,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:16,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:16,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:16,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:13:16,702 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:16,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:16,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1182018917, now seen corresponding path program 1 times [2023-08-26 12:13:16,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:16,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561804825] [2023-08-26 12:13:16,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:16,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:16,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:16,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561804825] [2023-08-26 12:13:16,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561804825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:16,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:16,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:13:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838852017] [2023-08-26 12:13:16,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:16,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:13:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:16,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:13:16,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:13:16,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 298 [2023-08-26 12:13:16,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:16,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:16,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 298 [2023-08-26 12:13:16,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:17,423 INFO L124 PetriNetUnfolderBase]: 4452/7025 cut-off events. [2023-08-26 12:13:17,423 INFO L125 PetriNetUnfolderBase]: For 4865/5139 co-relation queries the response was YES. [2023-08-26 12:13:17,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19754 conditions, 7025 events. 4452/7025 cut-off events. For 4865/5139 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 45901 event pairs, 1993 based on Foata normal form. 122/6665 useless extension candidates. Maximal degree in co-relation 19745. Up to 3734 conditions per place. [2023-08-26 12:13:17,441 INFO L140 encePairwiseOnDemand]: 294/298 looper letters, 90 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2023-08-26 12:13:17,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 598 flow [2023-08-26 12:13:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:13:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:13:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-26 12:13:17,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4469798657718121 [2023-08-26 12:13:17,443 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-26 12:13:17,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-26 12:13:17,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:17,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-26 12:13:17,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:17,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:17,446 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:17,446 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 160 flow. Second operand 5 states and 666 transitions. [2023-08-26 12:13:17,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 100 transitions, 598 flow [2023-08-26 12:13:17,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:17,450 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 183 flow [2023-08-26 12:13:17,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-26 12:13:17,450 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -13 predicate places. [2023-08-26 12:13:17,450 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 183 flow [2023-08-26 12:13:17,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:17,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:17,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:17,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:13:17,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:17,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash -959816168, now seen corresponding path program 1 times [2023-08-26 12:13:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:17,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341414659] [2023-08-26 12:13:17,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:17,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:17,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:17,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341414659] [2023-08-26 12:13:17,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341414659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:17,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:17,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:13:17,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173551977] [2023-08-26 12:13:17,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:17,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:13:17,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:17,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:13:17,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:13:17,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 298 [2023-08-26 12:13:17,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:17,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:17,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 298 [2023-08-26 12:13:17,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:17,917 INFO L124 PetriNetUnfolderBase]: 2421/4011 cut-off events. [2023-08-26 12:13:17,918 INFO L125 PetriNetUnfolderBase]: For 3361/3370 co-relation queries the response was YES. [2023-08-26 12:13:17,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11994 conditions, 4011 events. 2421/4011 cut-off events. For 3361/3370 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 26195 event pairs, 1153 based on Foata normal form. 40/3870 useless extension candidates. Maximal degree in co-relation 11982. Up to 2151 conditions per place. [2023-08-26 12:13:17,928 INFO L140 encePairwiseOnDemand]: 292/298 looper letters, 46 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-08-26 12:13:17,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 348 flow [2023-08-26 12:13:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:13:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:13:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-26 12:13:17,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3825503355704698 [2023-08-26 12:13:17,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-26 12:13:17,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-26 12:13:17,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:17,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-26 12:13:17,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:17,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:17,932 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:17,932 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 183 flow. Second operand 3 states and 342 transitions. [2023-08-26 12:13:17,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 348 flow [2023-08-26 12:13:17,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:17,935 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 198 flow [2023-08-26 12:13:17,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-26 12:13:17,936 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -12 predicate places. [2023-08-26 12:13:17,936 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 198 flow [2023-08-26 12:13:17,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:17,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:17,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:17,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:13:17,936 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:17,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2008008635, now seen corresponding path program 1 times [2023-08-26 12:13:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:17,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397117813] [2023-08-26 12:13:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:18,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397117813] [2023-08-26 12:13:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397117813] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:18,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:13:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909812333] [2023-08-26 12:13:18,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:18,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:13:18,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:18,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:13:18,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:13:18,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 298 [2023-08-26 12:13:18,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:18,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:18,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 298 [2023-08-26 12:13:18,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:18,348 INFO L124 PetriNetUnfolderBase]: 2060/3553 cut-off events. [2023-08-26 12:13:18,348 INFO L125 PetriNetUnfolderBase]: For 3389/3542 co-relation queries the response was YES. [2023-08-26 12:13:18,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11036 conditions, 3553 events. 2060/3553 cut-off events. For 3389/3542 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 23973 event pairs, 1062 based on Foata normal form. 64/3504 useless extension candidates. Maximal degree in co-relation 11023. Up to 2321 conditions per place. [2023-08-26 12:13:18,360 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 49 selfloop transitions, 3 changer transitions 1/62 dead transitions. [2023-08-26 12:13:18,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 401 flow [2023-08-26 12:13:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:13:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:13:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-26 12:13:18,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45861297539149887 [2023-08-26 12:13:18,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-26 12:13:18,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-26 12:13:18,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:18,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-26 12:13:18,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:18,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:18,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:18,364 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 198 flow. Second operand 3 states and 410 transitions. [2023-08-26 12:13:18,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 401 flow [2023-08-26 12:13:18,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:18,371 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 201 flow [2023-08-26 12:13:18,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-08-26 12:13:18,371 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -11 predicate places. [2023-08-26 12:13:18,371 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 201 flow [2023-08-26 12:13:18,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:18,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:18,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:18,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:13:18,372 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:18,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash 310469285, now seen corresponding path program 1 times [2023-08-26 12:13:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:18,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347438254] [2023-08-26 12:13:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:18,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347438254] [2023-08-26 12:13:18,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347438254] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:18,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:18,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:13:18,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464063898] [2023-08-26 12:13:18,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:18,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:13:18,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:18,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:13:18,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:13:18,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 298 [2023-08-26 12:13:18,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 201 flow. Second operand has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:18,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:18,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 298 [2023-08-26 12:13:18,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:18,887 INFO L124 PetriNetUnfolderBase]: 2063/3446 cut-off events. [2023-08-26 12:13:18,887 INFO L125 PetriNetUnfolderBase]: For 3221/3227 co-relation queries the response was YES. [2023-08-26 12:13:18,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11056 conditions, 3446 events. 2063/3446 cut-off events. For 3221/3227 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 21997 event pairs, 863 based on Foata normal form. 79/3485 useless extension candidates. Maximal degree in co-relation 11042. Up to 1684 conditions per place. [2023-08-26 12:13:18,900 INFO L140 encePairwiseOnDemand]: 290/298 looper letters, 55 selfloop transitions, 8 changer transitions 2/68 dead transitions. [2023-08-26 12:13:18,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 481 flow [2023-08-26 12:13:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:13:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:13:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2023-08-26 12:13:18,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3651006711409396 [2023-08-26 12:13:18,902 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 544 transitions. [2023-08-26 12:13:18,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 544 transitions. [2023-08-26 12:13:18,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:18,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 544 transitions. [2023-08-26 12:13:18,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:18,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:18,906 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:18,906 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 201 flow. Second operand 5 states and 544 transitions. [2023-08-26 12:13:18,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 481 flow [2023-08-26 12:13:18,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:18,911 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 225 flow [2023-08-26 12:13:18,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2023-08-26 12:13:18,912 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -8 predicate places. [2023-08-26 12:13:18,912 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 225 flow [2023-08-26 12:13:18,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:18,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:18,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:18,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:13:18,912 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:18,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash 963435776, now seen corresponding path program 1 times [2023-08-26 12:13:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:18,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391388506] [2023-08-26 12:13:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:19,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391388506] [2023-08-26 12:13:19,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391388506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:19,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:19,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:13:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739906105] [2023-08-26 12:13:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:19,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:13:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:19,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:13:19,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:13:19,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 298 [2023-08-26 12:13:19,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 225 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:19,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:19,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 298 [2023-08-26 12:13:19,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:20,232 INFO L124 PetriNetUnfolderBase]: 2389/3945 cut-off events. [2023-08-26 12:13:20,233 INFO L125 PetriNetUnfolderBase]: For 4045/4053 co-relation queries the response was YES. [2023-08-26 12:13:20,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13108 conditions, 3945 events. 2389/3945 cut-off events. For 4045/4053 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 25685 event pairs, 1192 based on Foata normal form. 12/3917 useless extension candidates. Maximal degree in co-relation 13093. Up to 3410 conditions per place. [2023-08-26 12:13:20,247 INFO L140 encePairwiseOnDemand]: 289/298 looper letters, 66 selfloop transitions, 10 changer transitions 1/80 dead transitions. [2023-08-26 12:13:20,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 559 flow [2023-08-26 12:13:20,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:13:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:13:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 790 transitions. [2023-08-26 12:13:20,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313758389261745 [2023-08-26 12:13:20,250 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 790 transitions. [2023-08-26 12:13:20,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 790 transitions. [2023-08-26 12:13:20,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:20,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 790 transitions. [2023-08-26 12:13:20,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.75) internal successors, (790), 8 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:20,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:20,256 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:20,256 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 225 flow. Second operand 8 states and 790 transitions. [2023-08-26 12:13:20,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 559 flow [2023-08-26 12:13:20,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 537 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:13:20,270 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 299 flow [2023-08-26 12:13:20,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=299, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2023-08-26 12:13:20,271 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 1 predicate places. [2023-08-26 12:13:20,271 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 299 flow [2023-08-26 12:13:20,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:20,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:20,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:20,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:13:20,272 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:20,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash -477251996, now seen corresponding path program 2 times [2023-08-26 12:13:20,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:20,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596260530] [2023-08-26 12:13:20,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:20,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:21,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:21,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596260530] [2023-08-26 12:13:21,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596260530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:21,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:21,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:13:21,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641510268] [2023-08-26 12:13:21,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:21,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:13:21,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:13:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:13:21,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 298 [2023-08-26 12:13:21,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 299 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:21,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:21,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 298 [2023-08-26 12:13:21,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:21,584 INFO L124 PetriNetUnfolderBase]: 2692/4423 cut-off events. [2023-08-26 12:13:21,584 INFO L125 PetriNetUnfolderBase]: For 5172/5178 co-relation queries the response was YES. [2023-08-26 12:13:21,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15188 conditions, 4423 events. 2692/4423 cut-off events. For 5172/5178 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 29010 event pairs, 1002 based on Foata normal form. 10/4392 useless extension candidates. Maximal degree in co-relation 15167. Up to 3453 conditions per place. [2023-08-26 12:13:21,601 INFO L140 encePairwiseOnDemand]: 289/298 looper letters, 68 selfloop transitions, 18 changer transitions 1/90 dead transitions. [2023-08-26 12:13:21,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 90 transitions, 681 flow [2023-08-26 12:13:21,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:13:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:13:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 875 transitions. [2023-08-26 12:13:21,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3262490678598061 [2023-08-26 12:13:21,603 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 875 transitions. [2023-08-26 12:13:21,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 875 transitions. [2023-08-26 12:13:21,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:21,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 875 transitions. [2023-08-26 12:13:21,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.22222222222223) internal successors, (875), 9 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:21,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 298.0) internal successors, (2980), 10 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:21,608 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 298.0) internal successors, (2980), 10 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:21,608 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 299 flow. Second operand 9 states and 875 transitions. [2023-08-26 12:13:21,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 90 transitions, 681 flow [2023-08-26 12:13:21,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 90 transitions, 670 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 12:13:21,625 INFO L231 Difference]: Finished difference. Result has 80 places, 58 transitions, 425 flow [2023-08-26 12:13:21,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=425, PETRI_PLACES=80, PETRI_TRANSITIONS=58} [2023-08-26 12:13:21,626 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2023-08-26 12:13:21,626 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 58 transitions, 425 flow [2023-08-26 12:13:21,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:21,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:21,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:21,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:13:21,627 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:21,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1393047226, now seen corresponding path program 3 times [2023-08-26 12:13:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:21,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884319030] [2023-08-26 12:13:21,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:21,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:22,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884319030] [2023-08-26 12:13:22,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884319030] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:22,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:22,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:13:22,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608460184] [2023-08-26 12:13:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:22,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:13:22,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:22,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:13:22,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:13:22,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 298 [2023-08-26 12:13:22,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 58 transitions, 425 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:22,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:22,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 298 [2023-08-26 12:13:22,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:22,961 INFO L124 PetriNetUnfolderBase]: 2670/4452 cut-off events. [2023-08-26 12:13:22,962 INFO L125 PetriNetUnfolderBase]: For 7477/7485 co-relation queries the response was YES. [2023-08-26 12:13:22,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16159 conditions, 4452 events. 2670/4452 cut-off events. For 7477/7485 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 29837 event pairs, 337 based on Foata normal form. 12/4431 useless extension candidates. Maximal degree in co-relation 16133. Up to 2768 conditions per place. [2023-08-26 12:13:22,989 INFO L140 encePairwiseOnDemand]: 290/298 looper letters, 83 selfloop transitions, 30 changer transitions 2/118 dead transitions. [2023-08-26 12:13:22,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 118 transitions, 1009 flow [2023-08-26 12:13:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 12:13:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 12:13:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1081 transitions. [2023-08-26 12:13:22,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32977425259304455 [2023-08-26 12:13:22,992 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1081 transitions. [2023-08-26 12:13:22,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1081 transitions. [2023-08-26 12:13:22,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:22,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1081 transitions. [2023-08-26 12:13:22,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.27272727272727) internal successors, (1081), 11 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:22,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 298.0) internal successors, (3576), 12 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:22,997 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 298.0) internal successors, (3576), 12 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:22,998 INFO L175 Difference]: Start difference. First operand has 80 places, 58 transitions, 425 flow. Second operand 11 states and 1081 transitions. [2023-08-26 12:13:22,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 118 transitions, 1009 flow [2023-08-26 12:13:23,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 118 transitions, 958 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:23,027 INFO L231 Difference]: Finished difference. Result has 92 places, 70 transitions, 600 flow [2023-08-26 12:13:23,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=600, PETRI_PLACES=92, PETRI_TRANSITIONS=70} [2023-08-26 12:13:23,027 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 25 predicate places. [2023-08-26 12:13:23,027 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 70 transitions, 600 flow [2023-08-26 12:13:23,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:23,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:23,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:23,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:13:23,028 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:23,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:23,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1034615826, now seen corresponding path program 1 times [2023-08-26 12:13:23,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:23,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985816943] [2023-08-26 12:13:23,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:23,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:23,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:23,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985816943] [2023-08-26 12:13:23,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985816943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:23,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:23,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:13:23,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799119056] [2023-08-26 12:13:23,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:23,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:13:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:23,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:13:23,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:13:23,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 298 [2023-08-26 12:13:23,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 70 transitions, 600 flow. Second operand has 10 states, 10 states have (on average 96.5) internal successors, (965), 10 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:23,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:23,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 298 [2023-08-26 12:13:23,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:24,243 INFO L124 PetriNetUnfolderBase]: 3146/5173 cut-off events. [2023-08-26 12:13:24,243 INFO L125 PetriNetUnfolderBase]: For 10660/10672 co-relation queries the response was YES. [2023-08-26 12:13:24,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18920 conditions, 5173 events. 3146/5173 cut-off events. For 10660/10672 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 35316 event pairs, 701 based on Foata normal form. 85/5233 useless extension candidates. Maximal degree in co-relation 18891. Up to 1263 conditions per place. [2023-08-26 12:13:24,270 INFO L140 encePairwiseOnDemand]: 287/298 looper letters, 67 selfloop transitions, 14 changer transitions 63/147 dead transitions. [2023-08-26 12:13:24,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 147 transitions, 1327 flow [2023-08-26 12:13:24,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:13:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:13:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1047 transitions. [2023-08-26 12:13:24,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35134228187919464 [2023-08-26 12:13:24,273 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1047 transitions. [2023-08-26 12:13:24,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1047 transitions. [2023-08-26 12:13:24,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:24,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1047 transitions. [2023-08-26 12:13:24,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.7) internal successors, (1047), 10 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:24,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 298.0) internal successors, (3278), 11 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:24,278 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 298.0) internal successors, (3278), 11 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:24,278 INFO L175 Difference]: Start difference. First operand has 92 places, 70 transitions, 600 flow. Second operand 10 states and 1047 transitions. [2023-08-26 12:13:24,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 147 transitions, 1327 flow [2023-08-26 12:13:24,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 147 transitions, 1260 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-08-26 12:13:24,327 INFO L231 Difference]: Finished difference. Result has 99 places, 54 transitions, 465 flow [2023-08-26 12:13:24,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=465, PETRI_PLACES=99, PETRI_TRANSITIONS=54} [2023-08-26 12:13:24,328 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 32 predicate places. [2023-08-26 12:13:24,328 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 54 transitions, 465 flow [2023-08-26 12:13:24,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.5) internal successors, (965), 10 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:24,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:24,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:24,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:13:24,329 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:24,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:24,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1749751534, now seen corresponding path program 1 times [2023-08-26 12:13:24,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:24,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069976639] [2023-08-26 12:13:24,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:24,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:24,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 12:13:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069976639] [2023-08-26 12:13:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069976639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:24,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:24,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:13:24,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800946881] [2023-08-26 12:13:24,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:24,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:13:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:13:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:13:24,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 298 [2023-08-26 12:13:24,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 54 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:24,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:24,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 298 [2023-08-26 12:13:24,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:24,722 INFO L124 PetriNetUnfolderBase]: 1173/2211 cut-off events. [2023-08-26 12:13:24,725 INFO L125 PetriNetUnfolderBase]: For 7515/7536 co-relation queries the response was YES. [2023-08-26 12:13:24,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8046 conditions, 2211 events. 1173/2211 cut-off events. For 7515/7536 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 15008 event pairs, 272 based on Foata normal form. 172/2353 useless extension candidates. Maximal degree in co-relation 8015. Up to 1618 conditions per place. [2023-08-26 12:13:24,735 INFO L140 encePairwiseOnDemand]: 292/298 looper letters, 64 selfloop transitions, 7 changer transitions 8/95 dead transitions. [2023-08-26 12:13:24,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 922 flow [2023-08-26 12:13:24,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:13:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:13:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-26 12:13:24,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4302013422818792 [2023-08-26 12:13:24,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-26 12:13:24,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-26 12:13:24,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:24,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-26 12:13:24,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:24,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:24,740 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:24,740 INFO L175 Difference]: Start difference. First operand has 99 places, 54 transitions, 465 flow. Second operand 5 states and 641 transitions. [2023-08-26 12:13:24,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 922 flow [2023-08-26 12:13:24,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 95 transitions, 797 flow, removed 17 selfloop flow, removed 13 redundant places. [2023-08-26 12:13:24,755 INFO L231 Difference]: Finished difference. Result has 90 places, 60 transitions, 431 flow [2023-08-26 12:13:24,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=431, PETRI_PLACES=90, PETRI_TRANSITIONS=60} [2023-08-26 12:13:24,755 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 23 predicate places. [2023-08-26 12:13:24,755 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 60 transitions, 431 flow [2023-08-26 12:13:24,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:24,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:24,756 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 12:13:24,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:13:24,756 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:24,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash -215099539, now seen corresponding path program 1 times [2023-08-26 12:13:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:24,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647588075] [2023-08-26 12:13:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:24,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647588075] [2023-08-26 12:13:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647588075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:24,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:24,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:13:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550630042] [2023-08-26 12:13:24,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:24,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:13:24,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:24,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:13:24,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:13:24,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 298 [2023-08-26 12:13:24,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 60 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:24,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:24,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 298 [2023-08-26 12:13:24,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:25,097 INFO L124 PetriNetUnfolderBase]: 641/1381 cut-off events. [2023-08-26 12:13:25,098 INFO L125 PetriNetUnfolderBase]: For 3070/3091 co-relation queries the response was YES. [2023-08-26 12:13:25,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 1381 events. 641/1381 cut-off events. For 3070/3091 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9410 event pairs, 44 based on Foata normal form. 132/1497 useless extension candidates. Maximal degree in co-relation 5704. Up to 596 conditions per place. [2023-08-26 12:13:25,103 INFO L140 encePairwiseOnDemand]: 292/298 looper letters, 69 selfloop transitions, 13 changer transitions 14/112 dead transitions. [2023-08-26 12:13:25,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 112 transitions, 1009 flow [2023-08-26 12:13:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:13:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:13:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions. [2023-08-26 12:13:25,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42809204218600194 [2023-08-26 12:13:25,105 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 893 transitions. [2023-08-26 12:13:25,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions. [2023-08-26 12:13:25,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:25,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions. [2023-08-26 12:13:25,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,109 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,109 INFO L175 Difference]: Start difference. First operand has 90 places, 60 transitions, 431 flow. Second operand 7 states and 893 transitions. [2023-08-26 12:13:25,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 112 transitions, 1009 flow [2023-08-26 12:13:25,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 112 transitions, 1005 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:13:25,115 INFO L231 Difference]: Finished difference. Result has 98 places, 66 transitions, 515 flow [2023-08-26 12:13:25,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=98, PETRI_TRANSITIONS=66} [2023-08-26 12:13:25,115 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 31 predicate places. [2023-08-26 12:13:25,115 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 66 transitions, 515 flow [2023-08-26 12:13:25,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:25,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:25,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:13:25,116 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:25,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:25,116 INFO L85 PathProgramCache]: Analyzing trace with hash -976525220, now seen corresponding path program 1 times [2023-08-26 12:13:25,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:25,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842623883] [2023-08-26 12:13:25,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:25,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:25,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:25,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842623883] [2023-08-26 12:13:25,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842623883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:25,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:25,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:13:25,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719612659] [2023-08-26 12:13:25,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:25,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:13:25,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:25,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:13:25,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:13:25,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 298 [2023-08-26 12:13:25,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 66 transitions, 515 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:25,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 298 [2023-08-26 12:13:25,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:25,571 INFO L124 PetriNetUnfolderBase]: 1447/3049 cut-off events. [2023-08-26 12:13:25,572 INFO L125 PetriNetUnfolderBase]: For 10029/10035 co-relation queries the response was YES. [2023-08-26 12:13:25,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13658 conditions, 3049 events. 1447/3049 cut-off events. For 10029/10035 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 23272 event pairs, 374 based on Foata normal form. 16/3037 useless extension candidates. Maximal degree in co-relation 13628. Up to 1332 conditions per place. [2023-08-26 12:13:25,582 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 83 selfloop transitions, 3 changer transitions 21/120 dead transitions. [2023-08-26 12:13:25,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 120 transitions, 1161 flow [2023-08-26 12:13:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:13:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:13:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-26 12:13:25,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4429530201342282 [2023-08-26 12:13:25,584 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-26 12:13:25,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-26 12:13:25,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:25,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-26 12:13:25,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,586 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,586 INFO L175 Difference]: Start difference. First operand has 98 places, 66 transitions, 515 flow. Second operand 4 states and 528 transitions. [2023-08-26 12:13:25,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 120 transitions, 1161 flow [2023-08-26 12:13:25,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 120 transitions, 1083 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-08-26 12:13:25,622 INFO L231 Difference]: Finished difference. Result has 101 places, 65 transitions, 485 flow [2023-08-26 12:13:25,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=485, PETRI_PLACES=101, PETRI_TRANSITIONS=65} [2023-08-26 12:13:25,622 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 34 predicate places. [2023-08-26 12:13:25,623 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 65 transitions, 485 flow [2023-08-26 12:13:25,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:25,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:25,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:13:25,623 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:25,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2059234892, now seen corresponding path program 2 times [2023-08-26 12:13:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:25,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353272140] [2023-08-26 12:13:25,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:25,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:25,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353272140] [2023-08-26 12:13:25,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353272140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:25,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:25,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:13:25,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156629507] [2023-08-26 12:13:25,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:25,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:13:25,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:25,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:13:25,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:13:25,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 298 [2023-08-26 12:13:25,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 65 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:25,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 298 [2023-08-26 12:13:25,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:25,953 INFO L124 PetriNetUnfolderBase]: 544/1290 cut-off events. [2023-08-26 12:13:25,953 INFO L125 PetriNetUnfolderBase]: For 3456/3576 co-relation queries the response was YES. [2023-08-26 12:13:25,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 1290 events. 544/1290 cut-off events. For 3456/3576 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 9709 event pairs, 18 based on Foata normal form. 174/1406 useless extension candidates. Maximal degree in co-relation 5514. Up to 385 conditions per place. [2023-08-26 12:13:25,958 INFO L140 encePairwiseOnDemand]: 292/298 looper letters, 44 selfloop transitions, 15 changer transitions 32/100 dead transitions. [2023-08-26 12:13:25,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 100 transitions, 923 flow [2023-08-26 12:13:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:13:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:13:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1125 transitions. [2023-08-26 12:13:25,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41946308724832215 [2023-08-26 12:13:25,961 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1125 transitions. [2023-08-26 12:13:25,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1125 transitions. [2023-08-26 12:13:25,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:25,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1125 transitions. [2023-08-26 12:13:25,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.0) internal successors, (1125), 9 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 298.0) internal successors, (2980), 10 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,966 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 298.0) internal successors, (2980), 10 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,966 INFO L175 Difference]: Start difference. First operand has 101 places, 65 transitions, 485 flow. Second operand 9 states and 1125 transitions. [2023-08-26 12:13:25,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 100 transitions, 923 flow [2023-08-26 12:13:25,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 100 transitions, 831 flow, removed 10 selfloop flow, removed 11 redundant places. [2023-08-26 12:13:25,976 INFO L231 Difference]: Finished difference. Result has 92 places, 46 transitions, 342 flow [2023-08-26 12:13:25,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=342, PETRI_PLACES=92, PETRI_TRANSITIONS=46} [2023-08-26 12:13:25,977 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 25 predicate places. [2023-08-26 12:13:25,977 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 46 transitions, 342 flow [2023-08-26 12:13:25,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:25,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:25,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:25,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 12:13:25,978 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:25,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1493422283, now seen corresponding path program 1 times [2023-08-26 12:13:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199762320] [2023-08-26 12:13:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:13:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:13:26,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:13:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199762320] [2023-08-26 12:13:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199762320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:13:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:13:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:13:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5809929] [2023-08-26 12:13:26,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:13:26,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:13:26,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:13:26,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:13:26,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:13:26,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 298 [2023-08-26 12:13:26,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 46 transitions, 342 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 12:13:26,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:13:26,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 298 [2023-08-26 12:13:26,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:13:26,247 INFO L124 PetriNetUnfolderBase]: 499/1095 cut-off events. [2023-08-26 12:13:26,248 INFO L125 PetriNetUnfolderBase]: For 3675/3675 co-relation queries the response was YES. [2023-08-26 12:13:26,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4963 conditions, 1095 events. 499/1095 cut-off events. For 3675/3675 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6766 event pairs, 228 based on Foata normal form. 2/1087 useless extension candidates. Maximal degree in co-relation 4937. Up to 683 conditions per place. [2023-08-26 12:13:26,251 INFO L140 encePairwiseOnDemand]: 294/298 looper letters, 49 selfloop transitions, 4 changer transitions 26/85 dead transitions. [2023-08-26 12:13:26,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 829 flow [2023-08-26 12:13:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:13:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:13:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2023-08-26 12:13:26,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4261744966442953 [2023-08-26 12:13:26,253 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2023-08-26 12:13:26,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2023-08-26 12:13:26,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:13:26,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2023-08-26 12:13:26,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:26,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:26,255 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:13:26,255 INFO L175 Difference]: Start difference. First operand has 92 places, 46 transitions, 342 flow. Second operand 5 states and 635 transitions. [2023-08-26 12:13:26,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 829 flow [2023-08-26 12:13:26,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 85 transitions, 692 flow, removed 32 selfloop flow, removed 12 redundant places. [2023-08-26 12:13:26,265 INFO L231 Difference]: Finished difference. Result has 79 places, 47 transitions, 293 flow [2023-08-26 12:13:26,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=79, PETRI_TRANSITIONS=47} [2023-08-26 12:13:26,266 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 12 predicate places. [2023-08-26 12:13:26,266 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 47 transitions, 293 flow [2023-08-26 12:13:26,266 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 12:13:26,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:13:26,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:26,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 12:13:26,266 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 12:13:26,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:13:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1180920435, now seen corresponding path program 2 times [2023-08-26 12:13:26,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:13:26,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824580840] [2023-08-26 12:13:26,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:13:26,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:13:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:13:26,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:13:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:13:26,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:13:26,383 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:13:26,384 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (51 of 52 remaining) [2023-08-26 12:13:26,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 52 remaining) [2023-08-26 12:13:26,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 52 remaining) [2023-08-26 12:13:26,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 52 remaining) [2023-08-26 12:13:26,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 52 remaining) [2023-08-26 12:13:26,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 52 remaining) [2023-08-26 12:13:26,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 52 remaining) [2023-08-26 12:13:26,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 52 remaining) [2023-08-26 12:13:26,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 52 remaining) [2023-08-26 12:13:26,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 52 remaining) [2023-08-26 12:13:26,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 52 remaining) [2023-08-26 12:13:26,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 52 remaining) [2023-08-26 12:13:26,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 52 remaining) [2023-08-26 12:13:26,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 52 remaining) [2023-08-26 12:13:26,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 52 remaining) [2023-08-26 12:13:26,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 52 remaining) [2023-08-26 12:13:26,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 52 remaining) [2023-08-26 12:13:26,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 12:13:26,391 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:13:26,396 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:13:26,396 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:13:26,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:13:26 BasicIcfg [2023-08-26 12:13:26,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:13:26,460 INFO L158 Benchmark]: Toolchain (without parser) took 21594.79ms. Allocated memory was 377.5MB in the beginning and 1.0GB in the end (delta: 671.1MB). Free memory was 352.2MB in the beginning and 431.7MB in the end (delta: -79.5MB). Peak memory consumption was 590.2MB. Max. memory is 16.0GB. [2023-08-26 12:13:26,460 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 377.5MB. Free memory is still 353.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:13:26,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.53ms. Allocated memory is still 377.5MB. Free memory was 352.2MB in the beginning and 329.3MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:13:26,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.13ms. Allocated memory is still 377.5MB. Free memory was 329.3MB in the beginning and 327.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:13:26,460 INFO L158 Benchmark]: Boogie Preprocessor took 21.08ms. Allocated memory is still 377.5MB. Free memory was 326.7MB in the beginning and 324.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:13:26,460 INFO L158 Benchmark]: RCFGBuilder took 752.75ms. Allocated memory is still 377.5MB. Free memory was 324.9MB in the beginning and 294.8MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 12:13:26,464 INFO L158 Benchmark]: TraceAbstraction took 20371.12ms. Allocated memory was 377.5MB in the beginning and 1.0GB in the end (delta: 671.1MB). Free memory was 294.4MB in the beginning and 431.7MB in the end (delta: -137.3MB). Peak memory consumption was 533.8MB. Max. memory is 16.0GB. [2023-08-26 12:13:26,466 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 377.5MB. Free memory is still 353.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 417.53ms. Allocated memory is still 377.5MB. Free memory was 352.2MB in the beginning and 329.3MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.13ms. Allocated memory is still 377.5MB. Free memory was 329.3MB in the beginning and 327.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.08ms. Allocated memory is still 377.5MB. Free memory was 326.7MB in the beginning and 324.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 752.75ms. Allocated memory is still 377.5MB. Free memory was 324.9MB in the beginning and 294.8MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 20371.12ms. Allocated memory was 377.5MB in the beginning and 1.0GB in the end (delta: 671.1MB). Free memory was 294.4MB in the beginning and 431.7MB in the end (delta: -137.3MB). Peak memory consumption was 533.8MB. 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: 6.5s, 162 PlacesBefore, 67 PlacesAfterwards, 155 TransitionsBefore, 59 TransitionsAfterwards, 4482 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 140 TotalNumberOfCompositions, 18229 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6699, independent: 6268, independent conditional: 0, independent unconditional: 6268, dependent: 431, dependent conditional: 0, dependent unconditional: 431, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6699, independent: 4184, independent conditional: 0, independent unconditional: 4184, dependent: 359, dependent conditional: 0, dependent unconditional: 359, unknown: 2156, unknown conditional: 0, unknown unconditional: 2156] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 333, Positive conditional cache size: 0, Positive unconditional cache size: 333, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L834] 0 pthread_t t2109; [L835] FCALL, FORK 0 pthread_create(&t2109, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2109, ((void *)0), P0, ((void *)0))=-2, t2109={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}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 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) [L765] EXPR 1 \read(y) [L765] 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) [L765] 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) [L766] 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)) [L767] 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)) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L836] 0 pthread_t t2110; 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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2109={6:0}, t2110={7:0}, weak$$choice1=0, weak$$choice2=255, 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}] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, 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}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L837] FCALL, FORK 0 pthread_create(&t2110, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2110, ((void *)0), P1, ((void *)0))=-1, t2109={6:0}, t2110={7:0}, weak$$choice1=0, weak$$choice2=255, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] 0 pthread_t t2111; [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] FCALL, FORK 0 pthread_create(&t2111, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2111, ((void *)0), P2, ((void *)0))=0, t2109={6:0}, t2110={7:0}, t2111={5:0}, weak$$choice1=0, weak$$choice2=255, 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}] [L794] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, 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}] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=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}] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 \read(y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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, t2109={6:0}, t2110={7:0}, t2111={5:0}, weak$$choice1=0, weak$$choice2=255, 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}] [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L856] 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", "safe014_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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=255, 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}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 199 locations, 52 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: 20.2s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 709 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 709 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1973 IncrementalHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 25 mSDtfsCounter, 1973 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=15, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 2456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:13:26,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...