/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:15:21,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:15:21,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 15:15:21,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:15:21,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:15:21,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:15:21,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:15:21,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:15:21,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:15:21,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:15:21,513 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:15:21,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:15:21,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:15:21,513 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:15:21,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:15:21,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:15:21,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:15:21,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:15:21,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:15:21,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:15:21,516 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:15:21,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:15:21,516 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:15:21,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:15:21,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:15:21,517 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:15:21,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:15:21,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:15:21,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:15:21,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:15:21,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:15:21,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:15:21,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:15:21,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:15:21,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:15:21,520 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 15:15:21,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:15:21,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:15:21,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:15:21,870 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:15:21,871 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:15:21,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-26 15:15:23,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:15:23,291 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:15:23,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-26 15:15:23,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb559ce2/35b905a07687443284ec243cd298451b/FLAGd72b8da88 [2023-08-26 15:15:23,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb559ce2/35b905a07687443284ec243cd298451b [2023-08-26 15:15:23,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:15:23,327 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:15:23,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:15:23,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:15:23,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:15:23,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c271f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23, skipping insertion in model container [2023-08-26 15:15:23,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,394 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:15:23,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:15:23,721 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:15:23,752 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:15:23,753 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:15:23,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:15:23,846 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:15:23,847 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:15:23,853 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:15:23,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23 WrapperNode [2023-08-26 15:15:23,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:15:23,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:15:23,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:15:23,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:15:23,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,934 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 187 [2023-08-26 15:15:23,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:15:23,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:15:23,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:15:23,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:15:23,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:15:23,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:15:23,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:15:23,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:15:23,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (1/1) ... [2023-08-26 15:15:23,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:15:24,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:15:24,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 15:15:24,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 15:15:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 15:15:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:15:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:15:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:15:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:15:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:15:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:15:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:15:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:15:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:15:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:15:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:15:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:15:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:15:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:15:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:15:24,067 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 15:15:24,241 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:15:24,243 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:15:24,720 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:15:25,319 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:15:25,320 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:15:25,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:15:25 BoogieIcfgContainer [2023-08-26 15:15:25,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:15:25,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:15:25,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:15:25,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:15:25,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:15:23" (1/3) ... [2023-08-26 15:15:25,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2570ccdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:15:25, skipping insertion in model container [2023-08-26 15:15:25,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:15:23" (2/3) ... [2023-08-26 15:15:25,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2570ccdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:15:25, skipping insertion in model container [2023-08-26 15:15:25,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:15:25" (3/3) ... [2023-08-26 15:15:25,332 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2023-08-26 15:15:25,349 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:15:25,350 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-08-26 15:15:25,350 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:15:25,481 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:15:25,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 171 transitions, 357 flow [2023-08-26 15:15:25,624 INFO L124 PetriNetUnfolderBase]: 3/168 cut-off events. [2023-08-26 15:15:25,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:15:25,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 3/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 247 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-08-26 15:15:25,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 171 transitions, 357 flow [2023-08-26 15:15:25,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 168 transitions, 345 flow [2023-08-26 15:15:25,644 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:15:25,657 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 168 transitions, 345 flow [2023-08-26 15:15:25,661 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 168 transitions, 345 flow [2023-08-26 15:15:25,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 168 transitions, 345 flow [2023-08-26 15:15:25,722 INFO L124 PetriNetUnfolderBase]: 3/168 cut-off events. [2023-08-26 15:15:25,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:15:25,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 3/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 247 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-08-26 15:15:25,728 INFO L119 LiptonReduction]: Number of co-enabled transitions 6324 [2023-08-26 15:15:36,510 INFO L134 LiptonReduction]: Checked pairs total: 33176 [2023-08-26 15:15:36,510 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-08-26 15:15:36,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:15:36,538 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;@7da37e54, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:15:36,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2023-08-26 15:15:36,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:15:36,540 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:15:36,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:15:36,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:36,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:15:36,541 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:15:36,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1138, now seen corresponding path program 1 times [2023-08-26 15:15:36,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592466089] [2023-08-26 15:15:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:15:36,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:36,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592466089] [2023-08-26 15:15:36,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592466089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:36,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:36,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:15:36,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471538924] [2023-08-26 15:15:36,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:15:36,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:15:36,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:15:36,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 321 [2023-08-26 15:15:36,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:36,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:36,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 321 [2023-08-26 15:15:36,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:42,043 INFO L124 PetriNetUnfolderBase]: 31868/44408 cut-off events. [2023-08-26 15:15:42,043 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-26 15:15:42,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88834 conditions, 44408 events. 31868/44408 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 3600. Compared 319065 event pairs, 31868 based on Foata normal form. 800/18753 useless extension candidates. Maximal degree in co-relation 88823. Up to 44200 conditions per place. [2023-08-26 15:15:42,424 INFO L140 encePairwiseOnDemand]: 299/321 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-26 15:15:42,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-08-26 15:15:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:15:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:15:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 313 transitions. [2023-08-26 15:15:42,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48753894080996885 [2023-08-26 15:15:42,442 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 313 transitions. [2023-08-26 15:15:42,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 313 transitions. [2023-08-26 15:15:42,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:42,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 313 transitions. [2023-08-26 15:15:42,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 156.5) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:42,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:42,454 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:42,456 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 153 flow. Second operand 2 states and 313 transitions. [2023-08-26 15:15:42,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-08-26 15:15:42,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:15:42,469 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-08-26 15:15:42,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-26 15:15:42,474 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-26 15:15:42,475 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-08-26 15:15:42,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:42,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:42,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 15:15:42,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:15:42,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:15:42,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:42,484 INFO L85 PathProgramCache]: Analyzing trace with hash 34881827, now seen corresponding path program 1 times [2023-08-26 15:15:42,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:42,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082072811] [2023-08-26 15:15:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:42,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:15:42,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:42,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082072811] [2023-08-26 15:15:42,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082072811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:42,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:42,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:15:42,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885363633] [2023-08-26 15:15:42,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:42,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:15:42,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:42,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:15:42,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:15:42,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-26 15:15:42,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 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 15:15:42,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:42,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-26 15:15:42,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:46,831 INFO L124 PetriNetUnfolderBase]: 28558/39698 cut-off events. [2023-08-26 15:15:46,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:15:46,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79557 conditions, 39698 events. 28558/39698 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3273. Compared 303854 event pairs, 5388 based on Foata normal form. 0/16862 useless extension candidates. Maximal degree in co-relation 79554. Up to 31802 conditions per place. [2023-08-26 15:15:47,051 INFO L140 encePairwiseOnDemand]: 318/321 looper letters, 80 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-26 15:15:47,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 342 flow [2023-08-26 15:15:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:15:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:15:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-26 15:15:47,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46313603322949115 [2023-08-26 15:15:47,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-26 15:15:47,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-26 15:15:47,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:47,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-26 15:15:47,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:47,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:47,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:47,063 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 446 transitions. [2023-08-26 15:15:47,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 342 flow [2023-08-26 15:15:47,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:15:47,068 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 106 flow [2023-08-26 15:15:47,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-26 15:15:47,070 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-26 15:15:47,070 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 106 flow [2023-08-26 15:15:47,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 15:15:47,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:47,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:15:47,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:15:47,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:15:47,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1081337576, now seen corresponding path program 1 times [2023-08-26 15:15:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:47,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925253344] [2023-08-26 15:15:47,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:47,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:15:47,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:47,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925253344] [2023-08-26 15:15:47,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925253344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:47,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:47,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:15:47,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892326193] [2023-08-26 15:15:47,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:47,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:15:47,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:47,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:15:47,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:15:47,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 321 [2023-08-26 15:15:47,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:47,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:47,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 321 [2023-08-26 15:15:47,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:52,669 INFO L124 PetriNetUnfolderBase]: 36763/51166 cut-off events. [2023-08-26 15:15:52,669 INFO L125 PetriNetUnfolderBase]: For 1231/1231 co-relation queries the response was YES. [2023-08-26 15:15:52,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103590 conditions, 51166 events. 36763/51166 cut-off events. For 1231/1231 co-relation queries the response was YES. Maximal size of possible extension queue 4351. Compared 383896 event pairs, 23293 based on Foata normal form. 0/21275 useless extension candidates. Maximal degree in co-relation 103586. Up to 38760 conditions per place. [2023-08-26 15:15:52,970 INFO L140 encePairwiseOnDemand]: 313/321 looper letters, 79 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-08-26 15:15:52,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 358 flow [2023-08-26 15:15:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:15:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:15:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-08-26 15:15:52,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46417445482866043 [2023-08-26 15:15:52,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-08-26 15:15:52,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-08-26 15:15:52,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:52,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-08-26 15:15:52,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:52,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:52,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:52,977 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 106 flow. Second operand 3 states and 447 transitions. [2023-08-26 15:15:52,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 358 flow [2023-08-26 15:15:52,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:15:52,981 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 144 flow [2023-08-26 15:15:52,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-26 15:15:52,982 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-26 15:15:52,982 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 144 flow [2023-08-26 15:15:52,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:52,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:52,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:15:52,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:15:52,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:15:52,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1081337578, now seen corresponding path program 1 times [2023-08-26 15:15:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31145169] [2023-08-26 15:15:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:52,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:15:53,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31145169] [2023-08-26 15:15:53,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31145169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:53,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:53,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:15:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107515875] [2023-08-26 15:15:53,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:53,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:15:53,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:53,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:15:53,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:15:53,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 321 [2023-08-26 15:15:53,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:53,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:53,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 321 [2023-08-26 15:15:53,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:55,698 INFO L124 PetriNetUnfolderBase]: 16564/23386 cut-off events. [2023-08-26 15:15:55,698 INFO L125 PetriNetUnfolderBase]: For 4860/4975 co-relation queries the response was YES. [2023-08-26 15:15:55,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54098 conditions, 23386 events. 16564/23386 cut-off events. For 4860/4975 co-relation queries the response was YES. Maximal size of possible extension queue 1685. Compared 160005 event pairs, 4209 based on Foata normal form. 30/16694 useless extension candidates. Maximal degree in co-relation 54093. Up to 10562 conditions per place. [2023-08-26 15:15:55,816 INFO L140 encePairwiseOnDemand]: 309/321 looper letters, 93 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2023-08-26 15:15:55,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 99 transitions, 467 flow [2023-08-26 15:15:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:15:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:15:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-26 15:15:55,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3987538940809969 [2023-08-26 15:15:55,818 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-26 15:15:55,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-26 15:15:55,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:55,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-26 15:15:55,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:55,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:55,825 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:55,825 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 144 flow. Second operand 4 states and 512 transitions. [2023-08-26 15:15:55,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 99 transitions, 467 flow [2023-08-26 15:15:55,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:15:55,854 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 179 flow [2023-08-26 15:15:55,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-08-26 15:15:55,856 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -19 predicate places. [2023-08-26 15:15:55,856 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 179 flow [2023-08-26 15:15:55,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:55,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:55,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:15:55,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:15:55,857 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:15:55,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:55,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1081337579, now seen corresponding path program 1 times [2023-08-26 15:15:55,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:55,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67294643] [2023-08-26 15:15:55,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:55,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:15:55,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:55,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67294643] [2023-08-26 15:15:55,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67294643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:55,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:55,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:15:56,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145015628] [2023-08-26 15:15:56,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:56,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:15:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:56,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:15:56,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:15:56,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 321 [2023-08-26 15:15:56,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:56,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:56,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 321 [2023-08-26 15:15:56,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:56,956 INFO L124 PetriNetUnfolderBase]: 4448/6487 cut-off events. [2023-08-26 15:15:56,957 INFO L125 PetriNetUnfolderBase]: For 3749/3787 co-relation queries the response was YES. [2023-08-26 15:15:56,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17827 conditions, 6487 events. 4448/6487 cut-off events. For 3749/3787 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 36414 event pairs, 3821 based on Foata normal form. 1718/7450 useless extension candidates. Maximal degree in co-relation 17820. Up to 6431 conditions per place. [2023-08-26 15:15:56,999 INFO L140 encePairwiseOnDemand]: 311/321 looper letters, 40 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2023-08-26 15:15:57,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 243 flow [2023-08-26 15:15:57,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:15:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:15:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-26 15:15:57,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821391484942887 [2023-08-26 15:15:57,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-26 15:15:57,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-26 15:15:57,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:57,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-26 15:15:57,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:57,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:57,017 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:57,017 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 179 flow. Second operand 3 states and 368 transitions. [2023-08-26 15:15:57,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 243 flow [2023-08-26 15:15:57,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:15:57,021 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 156 flow [2023-08-26 15:15:57,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-26 15:15:57,023 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -27 predicate places. [2023-08-26 15:15:57,023 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 156 flow [2023-08-26 15:15:57,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:57,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:57,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:57,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:15:57,024 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:15:57,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2081924937, now seen corresponding path program 1 times [2023-08-26 15:15:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129957192] [2023-08-26 15:15:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:15:57,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:57,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129957192] [2023-08-26 15:15:57,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129957192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:57,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:57,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:15:57,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548343069] [2023-08-26 15:15:57,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:57,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:15:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:57,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:15:57,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:15:57,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-26 15:15:57,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:57,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:57,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-26 15:15:57,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:57,773 INFO L124 PetriNetUnfolderBase]: 4100/6190 cut-off events. [2023-08-26 15:15:57,773 INFO L125 PetriNetUnfolderBase]: For 3327/3363 co-relation queries the response was YES. [2023-08-26 15:15:57,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16691 conditions, 6190 events. 4100/6190 cut-off events. For 3327/3363 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 37315 event pairs, 1053 based on Foata normal form. 4/5599 useless extension candidates. Maximal degree in co-relation 16684. Up to 4650 conditions per place. [2023-08-26 15:15:57,796 INFO L140 encePairwiseOnDemand]: 317/321 looper letters, 64 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2023-08-26 15:15:57,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 384 flow [2023-08-26 15:15:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:15:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:15:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-26 15:15:57,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43613707165109034 [2023-08-26 15:15:57,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-26 15:15:57,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-26 15:15:57,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:57,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-26 15:15:57,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:57,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:57,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:57,805 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 156 flow. Second operand 3 states and 420 transitions. [2023-08-26 15:15:57,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 384 flow [2023-08-26 15:15:57,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:15:57,808 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 168 flow [2023-08-26 15:15:57,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-26 15:15:57,809 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -26 predicate places. [2023-08-26 15:15:57,809 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 168 flow [2023-08-26 15:15:57,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:57,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:57,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:57,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:15:57,810 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:15:57,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:57,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2081925217, now seen corresponding path program 1 times [2023-08-26 15:15:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:57,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368108529] [2023-08-26 15:15:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:57,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:15:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368108529] [2023-08-26 15:15:57,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368108529] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:57,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:57,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:15:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445484066] [2023-08-26 15:15:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:57,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:15:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:15:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:15:57,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 321 [2023-08-26 15:15:57,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:57,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:57,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 321 [2023-08-26 15:15:57,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:58,674 INFO L124 PetriNetUnfolderBase]: 4038/6179 cut-off events. [2023-08-26 15:15:58,674 INFO L125 PetriNetUnfolderBase]: For 4211/4217 co-relation queries the response was YES. [2023-08-26 15:15:58,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17282 conditions, 6179 events. 4038/6179 cut-off events. For 4211/4217 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 37116 event pairs, 688 based on Foata normal form. 1/5681 useless extension candidates. Maximal degree in co-relation 17274. Up to 4860 conditions per place. [2023-08-26 15:15:58,729 INFO L140 encePairwiseOnDemand]: 318/321 looper letters, 65 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-26 15:15:58,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 412 flow [2023-08-26 15:15:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:15:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:15:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-26 15:15:58,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43094496365524404 [2023-08-26 15:15:58,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-26 15:15:58,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-26 15:15:58,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:58,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-26 15:15:58,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:58,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:58,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:58,735 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 168 flow. Second operand 3 states and 415 transitions. [2023-08-26 15:15:58,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 412 flow [2023-08-26 15:15:58,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:15:58,738 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 170 flow [2023-08-26 15:15:58,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-26 15:15:58,738 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -25 predicate places. [2023-08-26 15:15:58,738 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 170 flow [2023-08-26 15:15:58,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:58,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:58,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:58,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:15:58,739 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:15:58,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1502600779, now seen corresponding path program 1 times [2023-08-26 15:15:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588766187] [2023-08-26 15:15:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:15:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:15:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:15:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588766187] [2023-08-26 15:15:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588766187] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:15:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:15:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:15:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763380598] [2023-08-26 15:15:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:15:58,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:15:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:15:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:15:58,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:15:58,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 321 [2023-08-26 15:15:58,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:58,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:15:58,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 321 [2023-08-26 15:15:58,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:15:59,773 INFO L124 PetriNetUnfolderBase]: 4614/7165 cut-off events. [2023-08-26 15:15:59,773 INFO L125 PetriNetUnfolderBase]: For 4687/4702 co-relation queries the response was YES. [2023-08-26 15:15:59,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20222 conditions, 7165 events. 4614/7165 cut-off events. For 4687/4702 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 45632 event pairs, 828 based on Foata normal form. 432/7244 useless extension candidates. Maximal degree in co-relation 20213. Up to 2332 conditions per place. [2023-08-26 15:15:59,800 INFO L140 encePairwiseOnDemand]: 305/321 looper letters, 102 selfloop transitions, 23 changer transitions 0/127 dead transitions. [2023-08-26 15:15:59,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 127 transitions, 718 flow [2023-08-26 15:15:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:15:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:15:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2023-08-26 15:15:59,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3729417000445038 [2023-08-26 15:15:59,803 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2023-08-26 15:15:59,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2023-08-26 15:15:59,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:15:59,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2023-08-26 15:15:59,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:59,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:59,809 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:59,809 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 170 flow. Second operand 7 states and 838 transitions. [2023-08-26 15:15:59,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 127 transitions, 718 flow [2023-08-26 15:15:59,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 127 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:15:59,814 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 366 flow [2023-08-26 15:15:59,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2023-08-26 15:15:59,814 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -18 predicate places. [2023-08-26 15:15:59,814 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 366 flow [2023-08-26 15:15:59,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:15:59,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:15:59,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:15:59,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:15:59,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:15:59,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:15:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 115170564, now seen corresponding path program 1 times [2023-08-26 15:15:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:15:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411571494] [2023-08-26 15:15:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:15:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:15:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411571494] [2023-08-26 15:16:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411571494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:00,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:00,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361519867] [2023-08-26 15:16:00,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:00,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:00,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:00,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 321 [2023-08-26 15:16:00,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 366 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 15:16:00,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:00,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 321 [2023-08-26 15:16:00,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:00,817 INFO L124 PetriNetUnfolderBase]: 4452/6939 cut-off events. [2023-08-26 15:16:00,817 INFO L125 PetriNetUnfolderBase]: For 10242/10278 co-relation queries the response was YES. [2023-08-26 15:16:00,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26524 conditions, 6939 events. 4452/6939 cut-off events. For 10242/10278 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 44171 event pairs, 1180 based on Foata normal form. 76/6660 useless extension candidates. Maximal degree in co-relation 26511. Up to 5426 conditions per place. [2023-08-26 15:16:00,850 INFO L140 encePairwiseOnDemand]: 318/321 looper letters, 75 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2023-08-26 15:16:00,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 625 flow [2023-08-26 15:16:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:16:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:16:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-26 15:16:00,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37538940809968846 [2023-08-26 15:16:00,853 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-26 15:16:00,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-26 15:16:00,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:00,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-26 15:16:00,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:00,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:00,857 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:00,857 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 366 flow. Second operand 4 states and 482 transitions. [2023-08-26 15:16:00,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 625 flow [2023-08-26 15:16:00,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 617 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 15:16:00,876 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 362 flow [2023-08-26 15:16:00,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-26 15:16:00,877 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -17 predicate places. [2023-08-26 15:16:00,877 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 362 flow [2023-08-26 15:16:00,878 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 15:16:00,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:00,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:00,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:16:00,878 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:00,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash 115082772, now seen corresponding path program 1 times [2023-08-26 15:16:00,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:00,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731148633] [2023-08-26 15:16:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731148633] [2023-08-26 15:16:01,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731148633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:01,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:01,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:16:01,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757822387] [2023-08-26 15:16:01,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:01,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:16:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:01,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:16:01,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:16:01,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 321 [2023-08-26 15:16:01,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 362 flow. Second operand has 4 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 15:16:01,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:01,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 321 [2023-08-26 15:16:01,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:02,411 INFO L124 PetriNetUnfolderBase]: 9534/14281 cut-off events. [2023-08-26 15:16:02,411 INFO L125 PetriNetUnfolderBase]: For 24235/24235 co-relation queries the response was YES. [2023-08-26 15:16:02,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53566 conditions, 14281 events. 9534/14281 cut-off events. For 24235/24235 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 88495 event pairs, 1736 based on Foata normal form. 120/13699 useless extension candidates. Maximal degree in co-relation 53553. Up to 8118 conditions per place. [2023-08-26 15:16:02,491 INFO L140 encePairwiseOnDemand]: 316/321 looper letters, 132 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2023-08-26 15:16:02,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 136 transitions, 1114 flow [2023-08-26 15:16:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:16:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:16:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-26 15:16:02,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42133956386292837 [2023-08-26 15:16:02,494 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-26 15:16:02,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-26 15:16:02,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:02,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-26 15:16:02,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:02,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:02,498 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:02,498 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 362 flow. Second operand 4 states and 541 transitions. [2023-08-26 15:16:02,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 136 transitions, 1114 flow [2023-08-26 15:16:02,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 136 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:16:02,527 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 388 flow [2023-08-26 15:16:02,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2023-08-26 15:16:02,528 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -14 predicate places. [2023-08-26 15:16:02,528 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 388 flow [2023-08-26 15:16:02,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 15:16:02,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:02,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:02,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:16:02,529 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:02,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash -724637410, now seen corresponding path program 1 times [2023-08-26 15:16:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:02,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124171992] [2023-08-26 15:16:02,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:02,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:02,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124171992] [2023-08-26 15:16:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124171992] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491504740] [2023-08-26 15:16:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:02,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:02,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 321 [2023-08-26 15:16:02,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 388 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 15:16:02,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:02,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 321 [2023-08-26 15:16:02,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:03,833 INFO L124 PetriNetUnfolderBase]: 5802/9085 cut-off events. [2023-08-26 15:16:03,833 INFO L125 PetriNetUnfolderBase]: For 15353/15535 co-relation queries the response was YES. [2023-08-26 15:16:03,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35410 conditions, 9085 events. 5802/9085 cut-off events. For 15353/15535 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 59242 event pairs, 2493 based on Foata normal form. 210/8764 useless extension candidates. Maximal degree in co-relation 35395. Up to 5670 conditions per place. [2023-08-26 15:16:03,878 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 80 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2023-08-26 15:16:03,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 727 flow [2023-08-26 15:16:03,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:16:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:16:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-26 15:16:03,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655244029075805 [2023-08-26 15:16:03,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-26 15:16:03,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-26 15:16:03,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:03,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-26 15:16:03,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:03,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:03,883 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:03,883 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 388 flow. Second operand 3 states and 352 transitions. [2023-08-26 15:16:03,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 727 flow [2023-08-26 15:16:03,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 724 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:16:03,902 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 412 flow [2023-08-26 15:16:03,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-08-26 15:16:03,903 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -12 predicate places. [2023-08-26 15:16:03,903 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 412 flow [2023-08-26 15:16:03,903 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 15:16:03,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:03,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:03,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:16:03,904 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:03,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash 885924512, now seen corresponding path program 1 times [2023-08-26 15:16:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:03,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838021023] [2023-08-26 15:16:03,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:03,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:04,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:04,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838021023] [2023-08-26 15:16:04,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838021023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:04,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:04,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:16:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108815584] [2023-08-26 15:16:04,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:04,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:16:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:04,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:16:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:16:04,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 321 [2023-08-26 15:16:04,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:04,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:04,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 321 [2023-08-26 15:16:04,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:05,010 INFO L124 PetriNetUnfolderBase]: 5802/9097 cut-off events. [2023-08-26 15:16:05,010 INFO L125 PetriNetUnfolderBase]: For 16218/16585 co-relation queries the response was YES. [2023-08-26 15:16:05,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37142 conditions, 9097 events. 5802/9097 cut-off events. For 16218/16585 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 59947 event pairs, 2407 based on Foata normal form. 31/8629 useless extension candidates. Maximal degree in co-relation 37126. Up to 7989 conditions per place. [2023-08-26 15:16:05,052 INFO L140 encePairwiseOnDemand]: 318/321 looper letters, 85 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-26 15:16:05,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 760 flow [2023-08-26 15:16:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:16:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:16:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-26 15:16:05,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43198338525441327 [2023-08-26 15:16:05,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-26 15:16:05,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-26 15:16:05,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:05,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-26 15:16:05,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:05,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:05,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:05,057 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 412 flow. Second operand 3 states and 416 transitions. [2023-08-26 15:16:05,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 760 flow [2023-08-26 15:16:05,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 720 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-26 15:16:05,085 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 394 flow [2023-08-26 15:16:05,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-08-26 15:16:05,086 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -12 predicate places. [2023-08-26 15:16:05,086 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 394 flow [2023-08-26 15:16:05,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:05,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:05,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:05,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:16:05,087 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:05,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:05,087 INFO L85 PathProgramCache]: Analyzing trace with hash -988922864, now seen corresponding path program 1 times [2023-08-26 15:16:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:05,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614717584] [2023-08-26 15:16:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:05,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:05,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:05,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614717584] [2023-08-26 15:16:05,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614717584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:05,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:05,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:16:05,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481796097] [2023-08-26 15:16:05,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:05,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:16:05,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:16:05,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:16:05,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 321 [2023-08-26 15:16:05,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 394 flow. Second operand has 8 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 15:16:05,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:05,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 321 [2023-08-26 15:16:05,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:06,143 INFO L124 PetriNetUnfolderBase]: 4304/7016 cut-off events. [2023-08-26 15:16:06,143 INFO L125 PetriNetUnfolderBase]: For 12904/13100 co-relation queries the response was YES. [2023-08-26 15:16:06,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26989 conditions, 7016 events. 4304/7016 cut-off events. For 12904/13100 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 45164 event pairs, 634 based on Foata normal form. 211/6967 useless extension candidates. Maximal degree in co-relation 26973. Up to 2655 conditions per place. [2023-08-26 15:16:06,176 INFO L140 encePairwiseOnDemand]: 309/321 looper letters, 132 selfloop transitions, 13 changer transitions 0/149 dead transitions. [2023-08-26 15:16:06,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 149 transitions, 1256 flow [2023-08-26 15:16:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:16:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:16:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2023-08-26 15:16:06,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3411214953271028 [2023-08-26 15:16:06,178 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2023-08-26 15:16:06,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2023-08-26 15:16:06,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:06,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2023-08-26 15:16:06,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:06,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:06,183 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:06,183 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 394 flow. Second operand 6 states and 657 transitions. [2023-08-26 15:16:06,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 149 transitions, 1256 flow [2023-08-26 15:16:06,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 149 transitions, 1244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:16:06,201 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 480 flow [2023-08-26 15:16:06,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2023-08-26 15:16:06,202 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -7 predicate places. [2023-08-26 15:16:06,202 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 480 flow [2023-08-26 15:16:06,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 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 15:16:06,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:06,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:06,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:16:06,203 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:06,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:06,203 INFO L85 PathProgramCache]: Analyzing trace with hash 461491941, now seen corresponding path program 1 times [2023-08-26 15:16:06,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:06,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224126249] [2023-08-26 15:16:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:06,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:06,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224126249] [2023-08-26 15:16:06,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224126249] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:06,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:06,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:16:06,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477095654] [2023-08-26 15:16:06,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:06,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:16:06,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:06,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:16:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:16:06,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 321 [2023-08-26 15:16:06,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:06,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:06,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 321 [2023-08-26 15:16:06,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:08,074 INFO L124 PetriNetUnfolderBase]: 10053/15488 cut-off events. [2023-08-26 15:16:08,074 INFO L125 PetriNetUnfolderBase]: For 31761/31761 co-relation queries the response was YES. [2023-08-26 15:16:08,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63751 conditions, 15488 events. 10053/15488 cut-off events. For 31761/31761 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 101485 event pairs, 2171 based on Foata normal form. 60/15106 useless extension candidates. Maximal degree in co-relation 63733. Up to 7713 conditions per place. [2023-08-26 15:16:08,166 INFO L140 encePairwiseOnDemand]: 316/321 looper letters, 156 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2023-08-26 15:16:08,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 160 transitions, 1478 flow [2023-08-26 15:16:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:16:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:16:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2023-08-26 15:16:08,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252336448598131 [2023-08-26 15:16:08,168 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2023-08-26 15:16:08,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2023-08-26 15:16:08,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:08,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2023-08-26 15:16:08,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:08,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:08,171 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:08,172 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 480 flow. Second operand 4 states and 546 transitions. [2023-08-26 15:16:08,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 160 transitions, 1478 flow [2023-08-26 15:16:08,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 160 transitions, 1439 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:16:08,248 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 483 flow [2023-08-26 15:16:08,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=483, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2023-08-26 15:16:08,249 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2023-08-26 15:16:08,249 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 483 flow [2023-08-26 15:16:08,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:08,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:08,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:08,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:16:08,249 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:08,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:08,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1835092543, now seen corresponding path program 2 times [2023-08-26 15:16:08,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:08,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237099957] [2023-08-26 15:16:08,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:08,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:08,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237099957] [2023-08-26 15:16:08,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237099957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:08,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896598125] [2023-08-26 15:16:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:08,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:16:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:16:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:16:08,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 321 [2023-08-26 15:16:08,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 483 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:08,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:08,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 321 [2023-08-26 15:16:08,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:11,035 INFO L124 PetriNetUnfolderBase]: 15800/24785 cut-off events. [2023-08-26 15:16:11,035 INFO L125 PetriNetUnfolderBase]: For 52092/52092 co-relation queries the response was YES. [2023-08-26 15:16:11,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101541 conditions, 24785 events. 15800/24785 cut-off events. For 52092/52092 co-relation queries the response was YES. Maximal size of possible extension queue 1251. Compared 181259 event pairs, 3963 based on Foata normal form. 60/23993 useless extension candidates. Maximal degree in co-relation 101522. Up to 11286 conditions per place. [2023-08-26 15:16:11,164 INFO L140 encePairwiseOnDemand]: 317/321 looper letters, 193 selfloop transitions, 5 changer transitions 0/198 dead transitions. [2023-08-26 15:16:11,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 198 transitions, 1814 flow [2023-08-26 15:16:11,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:16:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:16:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-08-26 15:16:11,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4261682242990654 [2023-08-26 15:16:11,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-08-26 15:16:11,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-08-26 15:16:11,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:11,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-08-26 15:16:11,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:11,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:11,171 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:11,171 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 483 flow. Second operand 5 states and 684 transitions. [2023-08-26 15:16:11,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 198 transitions, 1814 flow [2023-08-26 15:16:11,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 198 transitions, 1808 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:16:11,312 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 510 flow [2023-08-26 15:16:11,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2023-08-26 15:16:11,313 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2023-08-26 15:16:11,313 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 510 flow [2023-08-26 15:16:11,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:11,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:11,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:11,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:16:11,314 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:11,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -591834649, now seen corresponding path program 1 times [2023-08-26 15:16:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927864677] [2023-08-26 15:16:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:11,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:11,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927864677] [2023-08-26 15:16:11,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927864677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:11,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:11,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:16:11,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890949849] [2023-08-26 15:16:11,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:11,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:16:11,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:11,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:16:11,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:16:11,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 321 [2023-08-26 15:16:11,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 510 flow. Second operand has 9 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:11,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:11,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 321 [2023-08-26 15:16:11,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:14,414 INFO L124 PetriNetUnfolderBase]: 13551/21001 cut-off events. [2023-08-26 15:16:14,414 INFO L125 PetriNetUnfolderBase]: For 45196/45671 co-relation queries the response was YES. [2023-08-26 15:16:14,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82178 conditions, 21001 events. 13551/21001 cut-off events. For 45196/45671 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 150903 event pairs, 1624 based on Foata normal form. 708/21312 useless extension candidates. Maximal degree in co-relation 82156. Up to 7468 conditions per place. [2023-08-26 15:16:14,569 INFO L140 encePairwiseOnDemand]: 307/321 looper letters, 91 selfloop transitions, 10 changer transitions 96/202 dead transitions. [2023-08-26 15:16:14,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 202 transitions, 1754 flow [2023-08-26 15:16:14,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:16:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:16:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1066 transitions. [2023-08-26 15:16:14,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3320872274143302 [2023-08-26 15:16:14,572 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1066 transitions. [2023-08-26 15:16:14,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1066 transitions. [2023-08-26 15:16:14,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:14,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1066 transitions. [2023-08-26 15:16:14,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.6) internal successors, (1066), 10 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:14,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 321.0) internal successors, (3531), 11 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:14,578 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 321.0) internal successors, (3531), 11 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:14,578 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 510 flow. Second operand 10 states and 1066 transitions. [2023-08-26 15:16:14,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 202 transitions, 1754 flow [2023-08-26 15:16:14,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 202 transitions, 1741 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-26 15:16:14,781 INFO L231 Difference]: Finished difference. Result has 92 places, 61 transitions, 485 flow [2023-08-26 15:16:14,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=485, PETRI_PLACES=92, PETRI_TRANSITIONS=61} [2023-08-26 15:16:14,781 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2023-08-26 15:16:14,782 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 61 transitions, 485 flow [2023-08-26 15:16:14,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:14,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:14,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:14,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:16:14,782 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:14,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1856730620, now seen corresponding path program 1 times [2023-08-26 15:16:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:14,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661067974] [2023-08-26 15:16:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:14,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:15,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:15,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661067974] [2023-08-26 15:16:15,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661067974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:15,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:15,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:16:15,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910235041] [2023-08-26 15:16:15,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:15,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:16:15,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:15,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:16:15,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:16:15,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 321 [2023-08-26 15:16:15,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 61 transitions, 485 flow. Second operand has 9 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:15,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:15,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 321 [2023-08-26 15:16:15,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:17,775 INFO L124 PetriNetUnfolderBase]: 7944/12649 cut-off events. [2023-08-26 15:16:17,775 INFO L125 PetriNetUnfolderBase]: For 31731/32453 co-relation queries the response was YES. [2023-08-26 15:16:17,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50427 conditions, 12649 events. 7944/12649 cut-off events. For 31731/32453 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 87344 event pairs, 5321 based on Foata normal form. 63/12233 useless extension candidates. Maximal degree in co-relation 50400. Up to 11804 conditions per place. [2023-08-26 15:16:17,823 INFO L140 encePairwiseOnDemand]: 309/321 looper letters, 85 selfloop transitions, 30 changer transitions 7/127 dead transitions. [2023-08-26 15:16:17,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 127 transitions, 1200 flow [2023-08-26 15:16:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:16:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:16:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1009 transitions. [2023-08-26 15:16:17,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31433021806853584 [2023-08-26 15:16:17,826 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1009 transitions. [2023-08-26 15:16:17,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1009 transitions. [2023-08-26 15:16:17,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:17,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1009 transitions. [2023-08-26 15:16:17,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:17,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 321.0) internal successors, (3531), 11 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:17,832 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 321.0) internal successors, (3531), 11 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:17,833 INFO L175 Difference]: Start difference. First operand has 92 places, 61 transitions, 485 flow. Second operand 10 states and 1009 transitions. [2023-08-26 15:16:17,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 127 transitions, 1200 flow [2023-08-26 15:16:18,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 127 transitions, 1049 flow, removed 56 selfloop flow, removed 9 redundant places. [2023-08-26 15:16:18,010 INFO L231 Difference]: Finished difference. Result has 95 places, 87 transitions, 696 flow [2023-08-26 15:16:18,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=696, PETRI_PLACES=95, PETRI_TRANSITIONS=87} [2023-08-26 15:16:18,010 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 15 predicate places. [2023-08-26 15:16:18,010 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 696 flow [2023-08-26 15:16:18,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:18,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:18,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:18,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:16:18,011 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:18,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash 441290730, now seen corresponding path program 2 times [2023-08-26 15:16:18,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:18,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437532602] [2023-08-26 15:16:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:18,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:19,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:19,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437532602] [2023-08-26 15:16:19,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437532602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:19,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:19,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:16:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292123008] [2023-08-26 15:16:19,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:19,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:16:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:19,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:16:19,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:16:19,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 321 [2023-08-26 15:16:19,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 696 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 15:16:19,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:19,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 321 [2023-08-26 15:16:19,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:21,058 INFO L124 PetriNetUnfolderBase]: 7982/12697 cut-off events. [2023-08-26 15:16:21,058 INFO L125 PetriNetUnfolderBase]: For 32231/32888 co-relation queries the response was YES. [2023-08-26 15:16:21,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50356 conditions, 12697 events. 7982/12697 cut-off events. For 32231/32888 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 88535 event pairs, 3307 based on Foata normal form. 187/12443 useless extension candidates. Maximal degree in co-relation 50329. Up to 9942 conditions per place. [2023-08-26 15:16:21,110 INFO L140 encePairwiseOnDemand]: 310/321 looper letters, 89 selfloop transitions, 24 changer transitions 14/132 dead transitions. [2023-08-26 15:16:21,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 132 transitions, 1186 flow [2023-08-26 15:16:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:16:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:16:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 800 transitions. [2023-08-26 15:16:21,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3115264797507788 [2023-08-26 15:16:21,113 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 800 transitions. [2023-08-26 15:16:21,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 800 transitions. [2023-08-26 15:16:21,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:21,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 800 transitions. [2023-08-26 15:16:21,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:21,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:21,124 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:21,124 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 696 flow. Second operand 8 states and 800 transitions. [2023-08-26 15:16:21,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 132 transitions, 1186 flow [2023-08-26 15:16:21,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 132 transitions, 1134 flow, removed 21 selfloop flow, removed 2 redundant places. [2023-08-26 15:16:21,193 INFO L231 Difference]: Finished difference. Result has 102 places, 96 transitions, 799 flow [2023-08-26 15:16:21,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=799, PETRI_PLACES=102, PETRI_TRANSITIONS=96} [2023-08-26 15:16:21,194 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 22 predicate places. [2023-08-26 15:16:21,194 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 96 transitions, 799 flow [2023-08-26 15:16:21,194 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 15:16:21,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:21,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:21,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:16:21,195 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:21,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash -478480720, now seen corresponding path program 1 times [2023-08-26 15:16:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:21,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976170638] [2023-08-26 15:16:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:21,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:21,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:21,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976170638] [2023-08-26 15:16:21,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976170638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:21,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:21,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 15:16:21,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979624405] [2023-08-26 15:16:21,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:21,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 15:16:21,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 15:16:21,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-26 15:16:21,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 321 [2023-08-26 15:16:21,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 96 transitions, 799 flow. Second operand has 10 states, 10 states have (on average 93.7) internal successors, (937), 10 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:21,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:21,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 321 [2023-08-26 15:16:21,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:23,911 INFO L124 PetriNetUnfolderBase]: 9540/15025 cut-off events. [2023-08-26 15:16:23,912 INFO L125 PetriNetUnfolderBase]: For 43439/44281 co-relation queries the response was YES. [2023-08-26 15:16:23,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60211 conditions, 15025 events. 9540/15025 cut-off events. For 43439/44281 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 105131 event pairs, 2128 based on Foata normal form. 447/15117 useless extension candidates. Maximal degree in co-relation 60182. Up to 7340 conditions per place. [2023-08-26 15:16:23,997 INFO L140 encePairwiseOnDemand]: 307/321 looper letters, 98 selfloop transitions, 11 changer transitions 79/192 dead transitions. [2023-08-26 15:16:23,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 192 transitions, 1783 flow [2023-08-26 15:16:23,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:16:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:16:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1029 transitions. [2023-08-26 15:16:24,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3205607476635514 [2023-08-26 15:16:24,000 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1029 transitions. [2023-08-26 15:16:24,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1029 transitions. [2023-08-26 15:16:24,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:24,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1029 transitions. [2023-08-26 15:16:24,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.9) internal successors, (1029), 10 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 321.0) internal successors, (3531), 11 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,005 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 321.0) internal successors, (3531), 11 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,005 INFO L175 Difference]: Start difference. First operand has 102 places, 96 transitions, 799 flow. Second operand 10 states and 1029 transitions. [2023-08-26 15:16:24,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 192 transitions, 1783 flow [2023-08-26 15:16:24,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 192 transitions, 1727 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-26 15:16:24,126 INFO L231 Difference]: Finished difference. Result has 108 places, 76 transitions, 618 flow [2023-08-26 15:16:24,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=618, PETRI_PLACES=108, PETRI_TRANSITIONS=76} [2023-08-26 15:16:24,126 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places. [2023-08-26 15:16:24,127 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 76 transitions, 618 flow [2023-08-26 15:16:24,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.7) internal successors, (937), 10 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:24,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:24,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 15:16:24,127 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:24,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1930549376, now seen corresponding path program 2 times [2023-08-26 15:16:24,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:24,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682486713] [2023-08-26 15:16:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:24,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682486713] [2023-08-26 15:16:24,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682486713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:24,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:24,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 15:16:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205024024] [2023-08-26 15:16:24,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:24,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 15:16:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:24,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 15:16:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-26 15:16:24,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 321 [2023-08-26 15:16:24,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 76 transitions, 618 flow. Second operand has 11 states, 11 states have (on average 92.54545454545455) internal successors, (1018), 11 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:24,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 321 [2023-08-26 15:16:24,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:26,728 INFO L124 PetriNetUnfolderBase]: 7457/11823 cut-off events. [2023-08-26 15:16:26,728 INFO L125 PetriNetUnfolderBase]: For 40012/40681 co-relation queries the response was YES. [2023-08-26 15:16:26,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48522 conditions, 11823 events. 7457/11823 cut-off events. For 40012/40681 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 80750 event pairs, 2071 based on Foata normal form. 277/11750 useless extension candidates. Maximal degree in co-relation 48490. Up to 5788 conditions per place. [2023-08-26 15:16:26,810 INFO L140 encePairwiseOnDemand]: 306/321 looper letters, 85 selfloop transitions, 17 changer transitions 72/178 dead transitions. [2023-08-26 15:16:26,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 178 transitions, 1601 flow [2023-08-26 15:16:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 15:16:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 15:16:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1309 transitions. [2023-08-26 15:16:26,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3136832015336688 [2023-08-26 15:16:26,814 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1309 transitions. [2023-08-26 15:16:26,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1309 transitions. [2023-08-26 15:16:26,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:26,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1309 transitions. [2023-08-26 15:16:26,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.6923076923077) internal successors, (1309), 13 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 321.0) internal successors, (4494), 14 states have internal predecessors, (4494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,822 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 321.0) internal successors, (4494), 14 states have internal predecessors, (4494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,822 INFO L175 Difference]: Start difference. First operand has 108 places, 76 transitions, 618 flow. Second operand 13 states and 1309 transitions. [2023-08-26 15:16:26,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 178 transitions, 1601 flow [2023-08-26 15:16:26,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 178 transitions, 1494 flow, removed 38 selfloop flow, removed 13 redundant places. [2023-08-26 15:16:26,996 INFO L231 Difference]: Finished difference. Result has 103 places, 73 transitions, 616 flow [2023-08-26 15:16:26,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=616, PETRI_PLACES=103, PETRI_TRANSITIONS=73} [2023-08-26 15:16:26,997 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 23 predicate places. [2023-08-26 15:16:26,997 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 73 transitions, 616 flow [2023-08-26 15:16:26,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 92.54545454545455) internal successors, (1018), 11 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:26,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:26,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 15:16:26,997 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:26,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2128571255, now seen corresponding path program 1 times [2023-08-26 15:16:26,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:26,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447090442] [2023-08-26 15:16:26,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:26,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:27,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447090442] [2023-08-26 15:16:27,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447090442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:27,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:27,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:16:27,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525167484] [2023-08-26 15:16:27,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:27,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:16:27,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:16:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:16:27,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 321 [2023-08-26 15:16:27,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 73 transitions, 616 flow. Second operand has 9 states, 9 states have (on average 93.66666666666667) internal successors, (843), 9 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:27,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:27,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 321 [2023-08-26 15:16:27,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:29,186 INFO L124 PetriNetUnfolderBase]: 5560/8813 cut-off events. [2023-08-26 15:16:29,186 INFO L125 PetriNetUnfolderBase]: For 27689/28163 co-relation queries the response was YES. [2023-08-26 15:16:29,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36844 conditions, 8813 events. 5560/8813 cut-off events. For 27689/28163 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 58029 event pairs, 2611 based on Foata normal form. 131/8673 useless extension candidates. Maximal degree in co-relation 36815. Up to 8528 conditions per place. [2023-08-26 15:16:29,225 INFO L140 encePairwiseOnDemand]: 311/321 looper letters, 69 selfloop transitions, 30 changer transitions 13/116 dead transitions. [2023-08-26 15:16:29,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 116 transitions, 1135 flow [2023-08-26 15:16:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:16:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:16:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 804 transitions. [2023-08-26 15:16:29,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3130841121495327 [2023-08-26 15:16:29,231 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 804 transitions. [2023-08-26 15:16:29,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 804 transitions. [2023-08-26 15:16:29,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:29,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 804 transitions. [2023-08-26 15:16:29,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:29,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:29,236 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:29,236 INFO L175 Difference]: Start difference. First operand has 103 places, 73 transitions, 616 flow. Second operand 8 states and 804 transitions. [2023-08-26 15:16:29,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 116 transitions, 1135 flow [2023-08-26 15:16:29,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 116 transitions, 1066 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-08-26 15:16:29,289 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 836 flow [2023-08-26 15:16:29,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=836, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2023-08-26 15:16:29,290 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 20 predicate places. [2023-08-26 15:16:29,290 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 836 flow [2023-08-26 15:16:29,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.66666666666667) internal successors, (843), 9 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:29,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:29,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:29,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 15:16:29,291 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:29,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1681907206, now seen corresponding path program 1 times [2023-08-26 15:16:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:29,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389338216] [2023-08-26 15:16:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:30,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389338216] [2023-08-26 15:16:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389338216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:30,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:30,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 15:16:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549269356] [2023-08-26 15:16:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:30,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 15:16:30,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:30,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 15:16:30,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-26 15:16:30,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 321 [2023-08-26 15:16:30,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 836 flow. Second operand has 11 states, 11 states have (on average 91.63636363636364) internal successors, (1008), 11 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:30,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:30,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 321 [2023-08-26 15:16:30,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:31,508 INFO L124 PetriNetUnfolderBase]: 5407/8547 cut-off events. [2023-08-26 15:16:31,508 INFO L125 PetriNetUnfolderBase]: For 31529/32312 co-relation queries the response was YES. [2023-08-26 15:16:31,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37060 conditions, 8547 events. 5407/8547 cut-off events. For 31529/32312 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 55411 event pairs, 1426 based on Foata normal form. 290/8603 useless extension candidates. Maximal degree in co-relation 37034. Up to 3276 conditions per place. [2023-08-26 15:16:31,558 INFO L140 encePairwiseOnDemand]: 314/321 looper letters, 115 selfloop transitions, 18 changer transitions 8/145 dead transitions. [2023-08-26 15:16:31,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 145 transitions, 1427 flow [2023-08-26 15:16:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:16:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:16:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 983 transitions. [2023-08-26 15:16:31,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30623052959501557 [2023-08-26 15:16:31,559 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 983 transitions. [2023-08-26 15:16:31,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 983 transitions. [2023-08-26 15:16:31,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:31,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 983 transitions. [2023-08-26 15:16:31,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.3) internal successors, (983), 10 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 321.0) internal successors, (3531), 11 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,563 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 321.0) internal successors, (3531), 11 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,563 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 836 flow. Second operand 10 states and 983 transitions. [2023-08-26 15:16:31,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 145 transitions, 1427 flow [2023-08-26 15:16:31,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 145 transitions, 1397 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-26 15:16:31,622 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 834 flow [2023-08-26 15:16:31,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=834, PETRI_PLACES=106, PETRI_TRANSITIONS=91} [2023-08-26 15:16:31,622 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 26 predicate places. [2023-08-26 15:16:31,622 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 834 flow [2023-08-26 15:16:31,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 91.63636363636364) internal successors, (1008), 11 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:31,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:31,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 15:16:31,623 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:31,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1681907208, now seen corresponding path program 1 times [2023-08-26 15:16:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:31,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149505520] [2023-08-26 15:16:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:31,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:31,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:31,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149505520] [2023-08-26 15:16:31,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149505520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:31,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:31,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:16:31,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971661571] [2023-08-26 15:16:31,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:31,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:16:31,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:31,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:16:31,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:16:31,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 321 [2023-08-26 15:16:31,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 91 transitions, 834 flow. Second operand has 9 states, 9 states have (on average 99.0) internal successors, (891), 9 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:31,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 321 [2023-08-26 15:16:31,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:32,979 INFO L124 PetriNetUnfolderBase]: 5054/7803 cut-off events. [2023-08-26 15:16:32,979 INFO L125 PetriNetUnfolderBase]: For 36876/37398 co-relation queries the response was YES. [2023-08-26 15:16:33,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34499 conditions, 7803 events. 5054/7803 cut-off events. For 36876/37398 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 47657 event pairs, 2345 based on Foata normal form. 137/7837 useless extension candidates. Maximal degree in co-relation 34472. Up to 6572 conditions per place. [2023-08-26 15:16:33,013 INFO L140 encePairwiseOnDemand]: 311/321 looper letters, 57 selfloop transitions, 5 changer transitions 50/114 dead transitions. [2023-08-26 15:16:33,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 114 transitions, 1190 flow [2023-08-26 15:16:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:16:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:16:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2023-08-26 15:16:33,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32621272808188695 [2023-08-26 15:16:33,015 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2023-08-26 15:16:33,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2023-08-26 15:16:33,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:33,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2023-08-26 15:16:33,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,018 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,018 INFO L175 Difference]: Start difference. First operand has 106 places, 91 transitions, 834 flow. Second operand 7 states and 733 transitions. [2023-08-26 15:16:33,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 114 transitions, 1190 flow [2023-08-26 15:16:33,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 114 transitions, 1128 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-08-26 15:16:33,054 INFO L231 Difference]: Finished difference. Result has 98 places, 63 transitions, 596 flow [2023-08-26 15:16:33,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=596, PETRI_PLACES=98, PETRI_TRANSITIONS=63} [2023-08-26 15:16:33,055 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2023-08-26 15:16:33,055 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 63 transitions, 596 flow [2023-08-26 15:16:33,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.0) internal successors, (891), 9 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:33,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:33,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 15:16:33,055 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:33,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1286735724, now seen corresponding path program 1 times [2023-08-26 15:16:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:33,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482267086] [2023-08-26 15:16:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:33,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:34,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:34,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482267086] [2023-08-26 15:16:34,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482267086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:34,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:34,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 15:16:34,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560176330] [2023-08-26 15:16:34,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:34,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 15:16:34,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:34,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 15:16:34,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-26 15:16:34,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 321 [2023-08-26 15:16:34,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 63 transitions, 596 flow. Second operand has 10 states, 10 states have (on average 91.6) internal successors, (916), 10 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:34,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:34,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 321 [2023-08-26 15:16:34,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:34,680 INFO L124 PetriNetUnfolderBase]: 510/819 cut-off events. [2023-08-26 15:16:34,680 INFO L125 PetriNetUnfolderBase]: For 4179/4192 co-relation queries the response was YES. [2023-08-26 15:16:34,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 819 events. 510/819 cut-off events. For 4179/4192 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3163 event pairs, 164 based on Foata normal form. 17/834 useless extension candidates. Maximal degree in co-relation 3873. Up to 355 conditions per place. [2023-08-26 15:16:34,684 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 41 selfloop transitions, 35 changer transitions 0/78 dead transitions. [2023-08-26 15:16:34,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 78 transitions, 824 flow [2023-08-26 15:16:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:16:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:16:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 763 transitions. [2023-08-26 15:16:34,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2971183800623053 [2023-08-26 15:16:34,685 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 763 transitions. [2023-08-26 15:16:34,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 763 transitions. [2023-08-26 15:16:34,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:34,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 763 transitions. [2023-08-26 15:16:34,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.375) internal successors, (763), 8 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:34,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:34,688 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:34,688 INFO L175 Difference]: Start difference. First operand has 98 places, 63 transitions, 596 flow. Second operand 8 states and 763 transitions. [2023-08-26 15:16:34,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 78 transitions, 824 flow [2023-08-26 15:16:34,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 727 flow, removed 17 selfloop flow, removed 18 redundant places. [2023-08-26 15:16:34,694 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 637 flow [2023-08-26 15:16:34,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=637, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2023-08-26 15:16:34,695 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -4 predicate places. [2023-08-26 15:16:34,695 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 637 flow [2023-08-26 15:16:34,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.6) internal successors, (916), 10 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:34,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:34,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:34,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 15:16:34,695 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:34,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1959222609, now seen corresponding path program 1 times [2023-08-26 15:16:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:34,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097303713] [2023-08-26 15:16:34,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:34,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:34,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:34,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097303713] [2023-08-26 15:16:34,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097303713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:34,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:34,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675910877] [2023-08-26 15:16:34,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:34,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:16:34,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:16:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:16:34,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 321 [2023-08-26 15:16:34,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 637 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:34,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:34,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 321 [2023-08-26 15:16:34,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:35,116 INFO L124 PetriNetUnfolderBase]: 417/719 cut-off events. [2023-08-26 15:16:35,117 INFO L125 PetriNetUnfolderBase]: For 3127/3134 co-relation queries the response was YES. [2023-08-26 15:16:35,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 719 events. 417/719 cut-off events. For 3127/3134 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3150 event pairs, 51 based on Foata normal form. 86/805 useless extension candidates. Maximal degree in co-relation 3320. Up to 426 conditions per place. [2023-08-26 15:16:35,121 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 61 selfloop transitions, 4 changer transitions 40/107 dead transitions. [2023-08-26 15:16:35,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 107 transitions, 1203 flow [2023-08-26 15:16:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:16:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:16:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2023-08-26 15:16:35,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3862928348909657 [2023-08-26 15:16:35,122 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 620 transitions. [2023-08-26 15:16:35,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 620 transitions. [2023-08-26 15:16:35,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:35,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 620 transitions. [2023-08-26 15:16:35,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:35,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:35,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:35,125 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 637 flow. Second operand 5 states and 620 transitions. [2023-08-26 15:16:35,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 107 transitions, 1203 flow [2023-08-26 15:16:35,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 1067 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-08-26 15:16:35,130 INFO L231 Difference]: Finished difference. Result has 74 places, 54 transitions, 441 flow [2023-08-26 15:16:35,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=74, PETRI_TRANSITIONS=54} [2023-08-26 15:16:35,131 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2023-08-26 15:16:35,131 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 54 transitions, 441 flow [2023-08-26 15:16:35,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:35,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:35,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:35,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 15:16:35,132 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:35,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2111170818, now seen corresponding path program 1 times [2023-08-26 15:16:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123427842] [2023-08-26 15:16:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:35,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:36,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:36,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123427842] [2023-08-26 15:16:36,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123427842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:36,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:36,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 15:16:36,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401175200] [2023-08-26 15:16:36,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:36,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 15:16:36,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:36,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 15:16:36,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-26 15:16:36,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 321 [2023-08-26 15:16:36,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 54 transitions, 441 flow. Second operand has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:36,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:36,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 321 [2023-08-26 15:16:36,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:36,855 INFO L124 PetriNetUnfolderBase]: 346/607 cut-off events. [2023-08-26 15:16:36,855 INFO L125 PetriNetUnfolderBase]: For 1778/1783 co-relation queries the response was YES. [2023-08-26 15:16:36,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 607 events. 346/607 cut-off events. For 1778/1783 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2457 event pairs, 139 based on Foata normal form. 9/614 useless extension candidates. Maximal degree in co-relation 3036. Up to 424 conditions per place. [2023-08-26 15:16:36,859 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 61 selfloop transitions, 19 changer transitions 0/82 dead transitions. [2023-08-26 15:16:36,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 82 transitions, 797 flow [2023-08-26 15:16:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:16:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:16:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2023-08-26 15:16:36,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2941700044503783 [2023-08-26 15:16:36,861 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2023-08-26 15:16:36,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2023-08-26 15:16:36,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:36,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2023-08-26 15:16:36,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:36,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:36,864 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:36,864 INFO L175 Difference]: Start difference. First operand has 74 places, 54 transitions, 441 flow. Second operand 7 states and 661 transitions. [2023-08-26 15:16:36,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 82 transitions, 797 flow [2023-08-26 15:16:36,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 774 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 15:16:36,871 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 557 flow [2023-08-26 15:16:36,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=557, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2023-08-26 15:16:36,871 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -2 predicate places. [2023-08-26 15:16:36,871 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 557 flow [2023-08-26 15:16:36,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:36,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:36,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:36,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 15:16:36,872 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:36,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1800126206, now seen corresponding path program 2 times [2023-08-26 15:16:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:36,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814536592] [2023-08-26 15:16:36,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:36,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:38,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814536592] [2023-08-26 15:16:38,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814536592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:38,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:38,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 15:16:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232103436] [2023-08-26 15:16:38,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:38,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 15:16:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:38,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 15:16:38,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-26 15:16:38,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 321 [2023-08-26 15:16:38,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 557 flow. Second operand has 10 states, 10 states have (on average 88.7) internal successors, (887), 10 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:38,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:38,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 321 [2023-08-26 15:16:38,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:38,640 INFO L124 PetriNetUnfolderBase]: 358/629 cut-off events. [2023-08-26 15:16:38,641 INFO L125 PetriNetUnfolderBase]: For 2150/2155 co-relation queries the response was YES. [2023-08-26 15:16:38,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3278 conditions, 629 events. 358/629 cut-off events. For 2150/2155 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2587 event pairs, 76 based on Foata normal form. 9/638 useless extension candidates. Maximal degree in co-relation 3257. Up to 281 conditions per place. [2023-08-26 15:16:38,644 INFO L140 encePairwiseOnDemand]: 313/321 looper letters, 49 selfloop transitions, 28 changer transitions 0/79 dead transitions. [2023-08-26 15:16:38,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 825 flow [2023-08-26 15:16:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:16:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:16:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 737 transitions. [2023-08-26 15:16:38,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.286993769470405 [2023-08-26 15:16:38,645 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 737 transitions. [2023-08-26 15:16:38,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 737 transitions. [2023-08-26 15:16:38,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:38,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 737 transitions. [2023-08-26 15:16:38,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:38,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:38,649 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:38,649 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 557 flow. Second operand 8 states and 737 transitions. [2023-08-26 15:16:38,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 79 transitions, 825 flow [2023-08-26 15:16:38,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 799 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 15:16:38,654 INFO L231 Difference]: Finished difference. Result has 82 places, 63 transitions, 633 flow [2023-08-26 15:16:38,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=633, PETRI_PLACES=82, PETRI_TRANSITIONS=63} [2023-08-26 15:16:38,654 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 2 predicate places. [2023-08-26 15:16:38,654 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 633 flow [2023-08-26 15:16:38,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.7) internal successors, (887), 10 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:38,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:38,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:38,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-26 15:16:38,655 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:38,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash -513068862, now seen corresponding path program 1 times [2023-08-26 15:16:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:38,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017970547] [2023-08-26 15:16:38,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:38,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:38,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:38,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017970547] [2023-08-26 15:16:38,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017970547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:38,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:38,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:16:38,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835555086] [2023-08-26 15:16:38,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:38,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:38,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:38,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:38,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:38,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 321 [2023-08-26 15:16:38,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 633 flow. Second operand has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:38,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:38,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 321 [2023-08-26 15:16:38,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:38,995 INFO L124 PetriNetUnfolderBase]: 243/465 cut-off events. [2023-08-26 15:16:38,995 INFO L125 PetriNetUnfolderBase]: For 2935/2940 co-relation queries the response was YES. [2023-08-26 15:16:38,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 465 events. 243/465 cut-off events. For 2935/2940 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1968 event pairs, 15 based on Foata normal form. 63/528 useless extension candidates. Maximal degree in co-relation 2572. Up to 178 conditions per place. [2023-08-26 15:16:38,998 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 84 selfloop transitions, 7 changer transitions 33/126 dead transitions. [2023-08-26 15:16:38,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 126 transitions, 1575 flow [2023-08-26 15:16:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:16:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:16:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-08-26 15:16:38,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3899273104880582 [2023-08-26 15:16:38,999 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-08-26 15:16:38,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-08-26 15:16:38,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:38,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-08-26 15:16:39,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:39,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:39,002 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:39,002 INFO L175 Difference]: Start difference. First operand has 82 places, 63 transitions, 633 flow. Second operand 6 states and 751 transitions. [2023-08-26 15:16:39,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 126 transitions, 1575 flow [2023-08-26 15:16:39,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 126 transitions, 1485 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-08-26 15:16:39,007 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 613 flow [2023-08-26 15:16:39,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=613, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2023-08-26 15:16:39,007 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 4 predicate places. [2023-08-26 15:16:39,007 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 613 flow [2023-08-26 15:16:39,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:39,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:39,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:39,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-26 15:16:39,008 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:39,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1171112856, now seen corresponding path program 1 times [2023-08-26 15:16:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:39,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056998442] [2023-08-26 15:16:39,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:40,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:40,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056998442] [2023-08-26 15:16:40,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056998442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:40,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:40,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 15:16:40,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18999162] [2023-08-26 15:16:40,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:40,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 15:16:40,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:40,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 15:16:40,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-26 15:16:40,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 321 [2023-08-26 15:16:40,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 613 flow. Second operand has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:40,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:40,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 321 [2023-08-26 15:16:40,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:40,972 INFO L124 PetriNetUnfolderBase]: 166/338 cut-off events. [2023-08-26 15:16:40,973 INFO L125 PetriNetUnfolderBase]: For 1627/1632 co-relation queries the response was YES. [2023-08-26 15:16:40,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1995 conditions, 338 events. 166/338 cut-off events. For 1627/1632 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1247 event pairs, 35 based on Foata normal form. 6/344 useless extension candidates. Maximal degree in co-relation 1970. Up to 155 conditions per place. [2023-08-26 15:16:40,974 INFO L140 encePairwiseOnDemand]: 313/321 looper letters, 56 selfloop transitions, 23 changer transitions 0/81 dead transitions. [2023-08-26 15:16:40,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 922 flow [2023-08-26 15:16:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:16:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:16:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 737 transitions. [2023-08-26 15:16:40,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.286993769470405 [2023-08-26 15:16:40,976 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 737 transitions. [2023-08-26 15:16:40,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 737 transitions. [2023-08-26 15:16:40,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:40,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 737 transitions. [2023-08-26 15:16:40,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:40,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:40,978 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:40,978 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 613 flow. Second operand 8 states and 737 transitions. [2023-08-26 15:16:40,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 922 flow [2023-08-26 15:16:40,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 81 transitions, 855 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-08-26 15:16:40,982 INFO L231 Difference]: Finished difference. Result has 86 places, 65 transitions, 664 flow [2023-08-26 15:16:40,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=664, PETRI_PLACES=86, PETRI_TRANSITIONS=65} [2023-08-26 15:16:40,982 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2023-08-26 15:16:40,983 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 65 transitions, 664 flow [2023-08-26 15:16:40,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:40,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:40,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:40,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-26 15:16:40,983 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:40,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash 833238663, now seen corresponding path program 1 times [2023-08-26 15:16:40,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:40,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241197089] [2023-08-26 15:16:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:41,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:41,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241197089] [2023-08-26 15:16:41,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241197089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:41,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:41,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:16:41,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838512554] [2023-08-26 15:16:41,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:41,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:16:41,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:16:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:16:41,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 321 [2023-08-26 15:16:41,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 65 transitions, 664 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:41,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:41,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 321 [2023-08-26 15:16:41,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:41,308 INFO L124 PetriNetUnfolderBase]: 144/292 cut-off events. [2023-08-26 15:16:41,308 INFO L125 PetriNetUnfolderBase]: For 1903/1908 co-relation queries the response was YES. [2023-08-26 15:16:41,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 292 events. 144/292 cut-off events. For 1903/1908 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1080 event pairs, 12 based on Foata normal form. 21/313 useless extension candidates. Maximal degree in co-relation 1701. Up to 113 conditions per place. [2023-08-26 15:16:41,310 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 83 selfloop transitions, 10 changer transitions 15/110 dead transitions. [2023-08-26 15:16:41,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 110 transitions, 1420 flow [2023-08-26 15:16:41,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:16:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:16:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-08-26 15:16:41,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38139741878059635 [2023-08-26 15:16:41,311 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-08-26 15:16:41,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-08-26 15:16:41,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:41,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-08-26 15:16:41,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:41,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:41,314 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:41,314 INFO L175 Difference]: Start difference. First operand has 86 places, 65 transitions, 664 flow. Second operand 7 states and 857 transitions. [2023-08-26 15:16:41,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 110 transitions, 1420 flow [2023-08-26 15:16:41,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 110 transitions, 1300 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-08-26 15:16:41,321 INFO L231 Difference]: Finished difference. Result has 86 places, 62 transitions, 594 flow [2023-08-26 15:16:41,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=594, PETRI_PLACES=86, PETRI_TRANSITIONS=62} [2023-08-26 15:16:41,322 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2023-08-26 15:16:41,322 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 62 transitions, 594 flow [2023-08-26 15:16:41,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:41,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:41,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:41,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-26 15:16:41,323 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-08-26 15:16:41,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash -162975875, now seen corresponding path program 1 times [2023-08-26 15:16:41,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:41,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902512718] [2023-08-26 15:16:41,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:41,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:16:41,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:16:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:16:41,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:16:41,503 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:16:41,504 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (73 of 74 remaining) [2023-08-26 15:16:41,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (72 of 74 remaining) [2023-08-26 15:16:41,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 74 remaining) [2023-08-26 15:16:41,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 74 remaining) [2023-08-26 15:16:41,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 74 remaining) [2023-08-26 15:16:41,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 74 remaining) [2023-08-26 15:16:41,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 74 remaining) [2023-08-26 15:16:41,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 74 remaining) [2023-08-26 15:16:41,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 74 remaining) [2023-08-26 15:16:41,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 74 remaining) [2023-08-26 15:16:41,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 74 remaining) [2023-08-26 15:16:41,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 74 remaining) [2023-08-26 15:16:41,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 74 remaining) [2023-08-26 15:16:41,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 74 remaining) [2023-08-26 15:16:41,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 74 remaining) [2023-08-26 15:16:41,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 74 remaining) [2023-08-26 15:16:41,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 74 remaining) [2023-08-26 15:16:41,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 74 remaining) [2023-08-26 15:16:41,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 74 remaining) [2023-08-26 15:16:41,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 74 remaining) [2023-08-26 15:16:41,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 74 remaining) [2023-08-26 15:16:41,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 74 remaining) [2023-08-26 15:16:41,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 74 remaining) [2023-08-26 15:16:41,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 74 remaining) [2023-08-26 15:16:41,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 74 remaining) [2023-08-26 15:16:41,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 74 remaining) [2023-08-26 15:16:41,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 74 remaining) [2023-08-26 15:16:41,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 74 remaining) [2023-08-26 15:16:41,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 74 remaining) [2023-08-26 15:16:41,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 74 remaining) [2023-08-26 15:16:41,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 74 remaining) [2023-08-26 15:16:41,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 74 remaining) [2023-08-26 15:16:41,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 74 remaining) [2023-08-26 15:16:41,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 74 remaining) [2023-08-26 15:16:41,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (28 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 74 remaining) [2023-08-26 15:16:41,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 74 remaining) [2023-08-26 15:16:41,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 74 remaining) [2023-08-26 15:16:41,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 74 remaining) [2023-08-26 15:16:41,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 74 remaining) [2023-08-26 15:16:41,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 74 remaining) [2023-08-26 15:16:41,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 74 remaining) [2023-08-26 15:16:41,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 74 remaining) [2023-08-26 15:16:41,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 74 remaining) [2023-08-26 15:16:41,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-26 15:16:41,514 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:41,519 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:16:41,519 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:16:41,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:16:41 BasicIcfg [2023-08-26 15:16:41,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:16:41,599 INFO L158 Benchmark]: Toolchain (without parser) took 78272.29ms. Allocated memory was 364.9MB in the beginning and 8.8GB in the end (delta: 8.5GB). Free memory was 322.7MB in the beginning and 6.3GB in the end (delta: -6.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-26 15:16:41,599 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 364.9MB. Free memory is still 341.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:16:41,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.57ms. Allocated memory is still 364.9MB. Free memory was 322.3MB in the beginning and 340.4MB in the end (delta: -18.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.0GB. [2023-08-26 15:16:41,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.62ms. Allocated memory is still 364.9MB. Free memory was 340.4MB in the beginning and 338.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:16:41,599 INFO L158 Benchmark]: Boogie Preprocessor took 54.69ms. Allocated memory is still 364.9MB. Free memory was 338.2MB in the beginning and 335.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 15:16:41,600 INFO L158 Benchmark]: RCFGBuilder took 1331.98ms. Allocated memory was 364.9MB in the beginning and 494.9MB in the end (delta: 130.0MB). Free memory was 335.4MB in the beginning and 452.7MB in the end (delta: -117.4MB). Peak memory consumption was 92.0MB. Max. memory is 16.0GB. [2023-08-26 15:16:41,600 INFO L158 Benchmark]: TraceAbstraction took 76272.59ms. Allocated memory was 494.9MB in the beginning and 8.8GB in the end (delta: 8.3GB). Free memory was 452.7MB in the beginning and 6.3GB in the end (delta: -5.8GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-26 15:16:41,605 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.17ms. Allocated memory is still 364.9MB. Free memory is still 341.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 527.57ms. Allocated memory is still 364.9MB. Free memory was 322.3MB in the beginning and 340.4MB in the end (delta: -18.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.62ms. Allocated memory is still 364.9MB. Free memory was 340.4MB in the beginning and 338.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.69ms. Allocated memory is still 364.9MB. Free memory was 338.2MB in the beginning and 335.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1331.98ms. Allocated memory was 364.9MB in the beginning and 494.9MB in the end (delta: 130.0MB). Free memory was 335.4MB in the beginning and 452.7MB in the end (delta: -117.4MB). Peak memory consumption was 92.0MB. Max. memory is 16.0GB. * TraceAbstraction took 76272.59ms. Allocated memory was 494.9MB in the beginning and 8.8GB in the end (delta: 8.3GB). Free memory was 452.7MB in the beginning and 6.3GB in the end (delta: -5.8GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.8s, 175 PlacesBefore, 80 PlacesAfterwards, 168 TransitionsBefore, 72 TransitionsAfterwards, 6324 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 150 TotalNumberOfCompositions, 33176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8285, independent: 7697, independent conditional: 0, independent unconditional: 7697, dependent: 588, dependent conditional: 0, dependent unconditional: 588, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2730, independent: 2648, independent conditional: 0, independent unconditional: 2648, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8285, independent: 5049, independent conditional: 0, independent unconditional: 5049, dependent: 506, dependent conditional: 0, dependent unconditional: 506, unknown: 2730, unknown conditional: 0, unknown unconditional: 2730] , Statistics on independence cache: Total cache size (in pairs): 425, Positive cache size: 374, Positive conditional cache size: 0, Positive unconditional cache size: 374, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=-2, t1780={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780={7:0}, t1781={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=-1, t1780={7:0}, t1781={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1782; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=0, t1780={7:0}, t1781={8:0}, t1782={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={7:0}, t1781={8:0}, t1782={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 856]: 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: 858]: 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, 225 locations, 74 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: 76.0s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 49.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1613 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1613 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 493 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4553 IncrementalHoareTripleChecker+Invalid, 5046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 493 mSolverCounterUnsat, 8 mSDtfsCounter, 4553 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=836occurred in iteration=21, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 388 ConstructedInterpolants, 0 QuantifiedInterpolants, 6723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 15:16:41,635 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...