/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/safe012_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:18:31,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:18:31,947 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:18:31,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:18:31,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:18:31,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:18:31,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:18:31,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:18:31,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:18:31,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:18:31,986 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:18:31,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:18:31,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:18:31,986 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:18:31,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:18:31,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:18:31,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:18:31,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:18:31,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:18:31,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:18:31,988 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:18:31,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:18:31,991 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:18:31,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:18:31,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:18:31,992 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:18:31,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:18:31,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:18:31,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:18:31,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:18:31,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:18:31,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:18:31,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:18:31,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:18:31,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:18:31,993 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:18:32,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:18:32,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:18:32,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:18:32,249 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:18:32,249 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:18:32,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_rmo.oepc.i [2023-08-26 15:18:33,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:18:33,403 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:18:33,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_rmo.oepc.i [2023-08-26 15:18:33,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79e2e772/30b8e9d31ef34d6da637bfca80429eff/FLAG0d797e295 [2023-08-26 15:18:33,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79e2e772/30b8e9d31ef34d6da637bfca80429eff [2023-08-26 15:18:33,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:18:33,439 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:18:33,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:18:33,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:18:33,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:18:33,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:18:33" (1/1) ... [2023-08-26 15:18:33,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108349ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:33, skipping insertion in model container [2023-08-26 15:18:33,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:18:33" (1/1) ... [2023-08-26 15:18:33,481 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:18:33,768 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:18:33,779 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:18:33,801 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:18:33,803 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:18:33,833 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:18:33,859 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:18:33,860 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:18:33,864 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:18:33,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:33 WrapperNode [2023-08-26 15:18:33,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:18:33,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:18:33,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:18:33,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:18:33,871 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:18:33" (1/1) ... [2023-08-26 15:18:33,897 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:18:33" (1/1) ... [2023-08-26 15:18:33,941 INFO L138 Inliner]: procedures = 176, calls = 68, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2023-08-26 15:18:33,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:18:33,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:18:33,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:18:33,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:18:33,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:33" (1/1) ... [2023-08-26 15:18:33,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:33" (1/1) ... [2023-08-26 15:18:33,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:18:33" (1/1) ... [2023-08-26 15:18:33,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:18:33" (1/1) ... [2023-08-26 15:18:33,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:33" (1/1) ... [2023-08-26 15:18:33,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:33" (1/1) ... [2023-08-26 15:18:33,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:33" (1/1) ... [2023-08-26 15:18:33,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:33" (1/1) ... [2023-08-26 15:18:33,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:18:33,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:18:33,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:18:33,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:18:33,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:33" (1/1) ... [2023-08-26 15:18:33,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:18:33,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:18:34,040 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:18:34,058 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:18:34,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 15:18:34,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:18:34,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:18:34,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:18:34,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:18:34,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:18:34,074 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:18:34,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:18:34,074 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:18:34,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:18:34,075 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:18:34,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:18:34,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:18:34,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:18:34,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:18:34,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:18:34,077 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:18:34,171 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:18:34,172 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:18:34,502 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:18:34,705 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:18:34,705 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:18:34,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:18:34 BoogieIcfgContainer [2023-08-26 15:18:34,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:18:34,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:18:34,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:18:34,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:18:34,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:18:33" (1/3) ... [2023-08-26 15:18:34,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2982b98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:18:34, skipping insertion in model container [2023-08-26 15:18:34,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:33" (2/3) ... [2023-08-26 15:18:34,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2982b98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:18:34, skipping insertion in model container [2023-08-26 15:18:34,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:18:34" (3/3) ... [2023-08-26 15:18:34,713 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_rmo.oepc.i [2023-08-26 15:18:34,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:18:34,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-08-26 15:18:34,724 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:18:34,787 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:18:34,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 159 transitions, 333 flow [2023-08-26 15:18:34,878 INFO L124 PetriNetUnfolderBase]: 3/156 cut-off events. [2023-08-26 15:18:34,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:18:34,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 156 events. 3/156 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 186 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 15:18:34,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 159 transitions, 333 flow [2023-08-26 15:18:34,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 156 transitions, 321 flow [2023-08-26 15:18:34,892 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:18:34,906 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 156 transitions, 321 flow [2023-08-26 15:18:34,909 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 156 transitions, 321 flow [2023-08-26 15:18:34,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 156 transitions, 321 flow [2023-08-26 15:18:34,938 INFO L124 PetriNetUnfolderBase]: 3/156 cut-off events. [2023-08-26 15:18:34,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:18:34,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 156 events. 3/156 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 186 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 15:18:34,942 INFO L119 LiptonReduction]: Number of co-enabled transitions 4482 [2023-08-26 15:18:41,207 INFO L134 LiptonReduction]: Checked pairs total: 16959 [2023-08-26 15:18:41,207 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-08-26 15:18:41,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:18:41,219 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;@3a9fecc3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:18:41,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-08-26 15:18:41,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:18:41,220 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:18:41,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:18:41,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:41,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:18:41,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:41,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash 814, now seen corresponding path program 1 times [2023-08-26 15:18:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:41,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613726826] [2023-08-26 15:18:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:41,293 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:18:41,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613726826] [2023-08-26 15:18:41,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613726826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:41,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:41,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:18:41,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765785285] [2023-08-26 15:18:41,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:41,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:18:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:41,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:18:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:18:41,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 303 [2023-08-26 15:18:41,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 123 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have 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:18:41,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:41,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 303 [2023-08-26 15:18:41,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:41,945 INFO L124 PetriNetUnfolderBase]: 4688/6810 cut-off events. [2023-08-26 15:18:41,946 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 15:18:41,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13611 conditions, 6810 events. 4688/6810 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 42101 event pairs, 4688 based on Foata normal form. 135/3878 useless extension candidates. Maximal degree in co-relation 13600. Up to 6755 conditions per place. [2023-08-26 15:18:41,977 INFO L140 encePairwiseOnDemand]: 286/303 looper letters, 34 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-08-26 15:18:41,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 157 flow [2023-08-26 15:18:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:18:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:18:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 303 transitions. [2023-08-26 15:18:41,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-26 15:18:41,991 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 303 transitions. [2023-08-26 15:18:41,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 303 transitions. [2023-08-26 15:18:41,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:41,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 303 transitions. [2023-08-26 15:18:41,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have 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:18:41,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have 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:18:41,999 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have 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:18:42,000 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 123 flow. Second operand 2 states and 303 transitions. [2023-08-26 15:18:42,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 157 flow [2023-08-26 15:18:42,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:18:42,003 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2023-08-26 15:18:42,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 15:18:42,006 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -18 predicate places. [2023-08-26 15:18:42,007 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2023-08-26 15:18:42,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have 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:18:42,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:42,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:18:42,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:18:42,007 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:42,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:42,008 INFO L85 PathProgramCache]: Analyzing trace with hash 803706, now seen corresponding path program 1 times [2023-08-26 15:18:42,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:42,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597735213] [2023-08-26 15:18:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:42,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:42,206 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:18:42,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597735213] [2023-08-26 15:18:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597735213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:42,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:42,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:18:42,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419033205] [2023-08-26 15:18:42,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:42,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:18:42,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:42,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:18:42,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:18:42,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 303 [2023-08-26 15:18:42,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have 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:18:42,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:42,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 303 [2023-08-26 15:18:42,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:42,596 INFO L124 PetriNetUnfolderBase]: 2825/4131 cut-off events. [2023-08-26 15:18:42,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:18:42,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8290 conditions, 4131 events. 2825/4131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 22238 event pairs, 2825 based on Foata normal form. 0/2758 useless extension candidates. Maximal degree in co-relation 8287. Up to 4122 conditions per place. [2023-08-26 15:18:42,615 INFO L140 encePairwiseOnDemand]: 296/303 looper letters, 31 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-26 15:18:42,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 138 flow [2023-08-26 15:18:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:18:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:18:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-26 15:18:42,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40154015401540155 [2023-08-26 15:18:42,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-26 15:18:42,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-26 15:18:42,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:42,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-26 15:18:42,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:18:42,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:18:42,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:18:42,624 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 365 transitions. [2023-08-26 15:18:42,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 138 flow [2023-08-26 15:18:42,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:18:42,627 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-26 15:18:42,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 15:18:42,628 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -22 predicate places. [2023-08-26 15:18:42,628 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-26 15:18:42,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have 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:18:42,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:42,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:18:42,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:18:42,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:42,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash 803705, now seen corresponding path program 1 times [2023-08-26 15:18:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762092011] [2023-08-26 15:18:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:42,726 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:18:42,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:42,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762092011] [2023-08-26 15:18:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762092011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:42,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:42,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:18:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570275080] [2023-08-26 15:18:42,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:42,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:18:42,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:42,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:18:42,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:18:42,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 303 [2023-08-26 15:18:42,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:42,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:42,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 303 [2023-08-26 15:18:42,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:42,979 INFO L124 PetriNetUnfolderBase]: 1648/2583 cut-off events. [2023-08-26 15:18:42,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:18:42,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 2583 events. 1648/2583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14389 event pairs, 1099 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 5141. Up to 1646 conditions per place. [2023-08-26 15:18:42,991 INFO L140 encePairwiseOnDemand]: 290/303 looper letters, 32 selfloop transitions, 7 changer transitions 1/42 dead transitions. [2023-08-26 15:18:42,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 172 flow [2023-08-26 15:18:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:18:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:18:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 15:18:42,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39713971397139713 [2023-08-26 15:18:42,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 15:18:42,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 15:18:42,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:42,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 15:18:42,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:42,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:18:42,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:18:42,996 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 361 transitions. [2023-08-26 15:18:42,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 172 flow [2023-08-26 15:18:42,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:18:42,997 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 125 flow [2023-08-26 15:18:42,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 15:18:42,998 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -21 predicate places. [2023-08-26 15:18:42,998 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 125 flow [2023-08-26 15:18:42,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:42,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:42,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:42,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:18:43,001 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:43,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash -449628364, now seen corresponding path program 1 times [2023-08-26 15:18:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:43,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854660667] [2023-08-26 15:18:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:43,140 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:18:43,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:43,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854660667] [2023-08-26 15:18:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854660667] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:43,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:43,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:18:43,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201362166] [2023-08-26 15:18:43,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:43,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:18:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:43,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:18:43,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:18:43,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 303 [2023-08-26 15:18:43,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have 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:18:43,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:43,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 303 [2023-08-26 15:18:43,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:43,367 INFO L124 PetriNetUnfolderBase]: 1371/2227 cut-off events. [2023-08-26 15:18:43,367 INFO L125 PetriNetUnfolderBase]: For 574/613 co-relation queries the response was YES. [2023-08-26 15:18:43,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5609 conditions, 2227 events. 1371/2227 cut-off events. For 574/613 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 12722 event pairs, 907 based on Foata normal form. 0/2056 useless extension candidates. Maximal degree in co-relation 5604. Up to 1462 conditions per place. [2023-08-26 15:18:43,374 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 46 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-26 15:18:43,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 297 flow [2023-08-26 15:18:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:18:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:18:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-26 15:18:43,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46204620462046203 [2023-08-26 15:18:43,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-26 15:18:43,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-26 15:18:43,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:43,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-26 15:18:43,377 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:18:43,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:18:43,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:18:43,378 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 125 flow. Second operand 3 states and 420 transitions. [2023-08-26 15:18:43,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 297 flow [2023-08-26 15:18:43,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:18:43,382 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 124 flow [2023-08-26 15:18:43,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 15:18:43,383 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -21 predicate places. [2023-08-26 15:18:43,383 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 124 flow [2023-08-26 15:18:43,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have 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:18:43,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:43,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:43,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:18:43,384 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:43,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash -449628051, now seen corresponding path program 1 times [2023-08-26 15:18:43,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:43,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586598234] [2023-08-26 15:18:43,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:43,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:18:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586598234] [2023-08-26 15:18:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586598234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:43,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:43,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:18:43,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472131261] [2023-08-26 15:18:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:43,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:18:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:18:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:18:43,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 303 [2023-08-26 15:18:43,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:43,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:43,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 303 [2023-08-26 15:18:43,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:43,668 INFO L124 PetriNetUnfolderBase]: 1277/2116 cut-off events. [2023-08-26 15:18:43,668 INFO L125 PetriNetUnfolderBase]: For 592/601 co-relation queries the response was YES. [2023-08-26 15:18:43,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5445 conditions, 2116 events. 1277/2116 cut-off events. For 592/601 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 12367 event pairs, 271 based on Foata normal form. 0/1950 useless extension candidates. Maximal degree in co-relation 5439. Up to 1652 conditions per place. [2023-08-26 15:18:43,676 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 43 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-26 15:18:43,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 272 flow [2023-08-26 15:18:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:18:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:18:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-26 15:18:43,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521452145214521 [2023-08-26 15:18:43,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-26 15:18:43,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-26 15:18:43,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:43,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-26 15:18:43,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have 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:18:43,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:18:43,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:18:43,681 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 124 flow. Second operand 3 states and 411 transitions. [2023-08-26 15:18:43,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 272 flow [2023-08-26 15:18:43,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:18:43,682 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 126 flow [2023-08-26 15:18:43,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-26 15:18:43,683 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -20 predicate places. [2023-08-26 15:18:43,683 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 126 flow [2023-08-26 15:18:43,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:43,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:43,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:43,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:18:43,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:43,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1019236707, now seen corresponding path program 1 times [2023-08-26 15:18:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:43,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381284758] [2023-08-26 15:18:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:43,765 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:18:43,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381284758] [2023-08-26 15:18:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381284758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:43,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:18:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429869997] [2023-08-26 15:18:43,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:43,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:18:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:43,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:18:43,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:18:43,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 303 [2023-08-26 15:18:43,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have 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:18:43,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:43,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 303 [2023-08-26 15:18:43,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:44,016 INFO L124 PetriNetUnfolderBase]: 1398/2325 cut-off events. [2023-08-26 15:18:44,016 INFO L125 PetriNetUnfolderBase]: For 371/371 co-relation queries the response was YES. [2023-08-26 15:18:44,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5929 conditions, 2325 events. 1398/2325 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13914 event pairs, 409 based on Foata normal form. 0/2144 useless extension candidates. Maximal degree in co-relation 5922. Up to 992 conditions per place. [2023-08-26 15:18:44,024 INFO L140 encePairwiseOnDemand]: 296/303 looper letters, 56 selfloop transitions, 6 changer transitions 2/66 dead transitions. [2023-08-26 15:18:44,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 348 flow [2023-08-26 15:18:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:18:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:18:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-26 15:18:44,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3927392739273927 [2023-08-26 15:18:44,026 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-26 15:18:44,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-26 15:18:44,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:44,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-26 15:18:44,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:44,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:44,029 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:44,029 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 126 flow. Second operand 4 states and 476 transitions. [2023-08-26 15:18:44,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 348 flow [2023-08-26 15:18:44,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:18:44,030 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 166 flow [2023-08-26 15:18:44,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-26 15:18:44,031 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -18 predicate places. [2023-08-26 15:18:44,031 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 166 flow [2023-08-26 15:18:44,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have 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:18:44,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:44,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:44,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:18:44,032 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:44,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1053569652, now seen corresponding path program 1 times [2023-08-26 15:18:44,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:44,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821534921] [2023-08-26 15:18:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:44,197 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:18:44,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:44,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821534921] [2023-08-26 15:18:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821534921] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:44,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:18:44,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381747153] [2023-08-26 15:18:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:44,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:18:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:44,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:18:44,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:18:44,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 303 [2023-08-26 15:18:44,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have 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:18:44,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:44,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 303 [2023-08-26 15:18:44,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:44,426 INFO L124 PetriNetUnfolderBase]: 1299/2145 cut-off events. [2023-08-26 15:18:44,426 INFO L125 PetriNetUnfolderBase]: For 1632/1632 co-relation queries the response was YES. [2023-08-26 15:18:44,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5981 conditions, 2145 events. 1299/2145 cut-off events. For 1632/1632 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12088 event pairs, 547 based on Foata normal form. 30/2138 useless extension candidates. Maximal degree in co-relation 5972. Up to 1333 conditions per place. [2023-08-26 15:18:44,432 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 52 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2023-08-26 15:18:44,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 331 flow [2023-08-26 15:18:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:18:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:18:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-26 15:18:44,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3927392739273927 [2023-08-26 15:18:44,433 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-26 15:18:44,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-26 15:18:44,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:44,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-26 15:18:44,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:44,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:44,436 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:44,436 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 166 flow. Second operand 4 states and 476 transitions. [2023-08-26 15:18:44,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 331 flow [2023-08-26 15:18:44,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:18:44,440 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 163 flow [2023-08-26 15:18:44,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-26 15:18:44,441 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -18 predicate places. [2023-08-26 15:18:44,441 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 163 flow [2023-08-26 15:18:44,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have 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:18:44,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:44,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:44,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:18:44,441 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:44,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1054800660, now seen corresponding path program 1 times [2023-08-26 15:18:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:44,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829095109] [2023-08-26 15:18:44,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:44,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:44,521 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:18:44,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:44,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829095109] [2023-08-26 15:18:44,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829095109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:44,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:44,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:18:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446068206] [2023-08-26 15:18:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:44,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:18:44,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:18:44,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:18:44,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 303 [2023-08-26 15:18:44,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have 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:18:44,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:44,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 303 [2023-08-26 15:18:44,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:44,864 INFO L124 PetriNetUnfolderBase]: 2189/3555 cut-off events. [2023-08-26 15:18:44,864 INFO L125 PetriNetUnfolderBase]: For 3544/3613 co-relation queries the response was YES. [2023-08-26 15:18:44,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10122 conditions, 3555 events. 2189/3555 cut-off events. For 3544/3613 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 22400 event pairs, 672 based on Foata normal form. 56/3490 useless extension candidates. Maximal degree in co-relation 10114. Up to 1275 conditions per place. [2023-08-26 15:18:44,874 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 72 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2023-08-26 15:18:44,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 520 flow [2023-08-26 15:18:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:18:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:18:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-26 15:18:44,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44884488448844884 [2023-08-26 15:18:44,875 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-26 15:18:44,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-26 15:18:44,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:44,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-26 15:18:44,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:44,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:44,878 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:44,878 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 163 flow. Second operand 4 states and 544 transitions. [2023-08-26 15:18:44,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 520 flow [2023-08-26 15:18:44,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:18:44,884 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 178 flow [2023-08-26 15:18:44,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-26 15:18:44,885 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -15 predicate places. [2023-08-26 15:18:44,885 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 178 flow [2023-08-26 15:18:44,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have 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:18:44,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:44,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:44,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:18:44,886 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:44,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1699148471, now seen corresponding path program 1 times [2023-08-26 15:18:44,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:44,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370281209] [2023-08-26 15:18:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:44,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:45,025 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:18:45,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370281209] [2023-08-26 15:18:45,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370281209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:45,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:45,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:18:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540982802] [2023-08-26 15:18:45,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:45,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:18:45,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:18:45,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:18:45,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 303 [2023-08-26 15:18:45,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have 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:18:45,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:45,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 303 [2023-08-26 15:18:45,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:45,275 INFO L124 PetriNetUnfolderBase]: 1683/2734 cut-off events. [2023-08-26 15:18:45,275 INFO L125 PetriNetUnfolderBase]: For 1542/1554 co-relation queries the response was YES. [2023-08-26 15:18:45,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8057 conditions, 2734 events. 1683/2734 cut-off events. For 1542/1554 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 15818 event pairs, 713 based on Foata normal form. 65/2755 useless extension candidates. Maximal degree in co-relation 8047. Up to 1403 conditions per place. [2023-08-26 15:18:45,285 INFO L140 encePairwiseOnDemand]: 296/303 looper letters, 53 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2023-08-26 15:18:45,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 391 flow [2023-08-26 15:18:45,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:18:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:18:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2023-08-26 15:18:45,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37541254125412543 [2023-08-26 15:18:45,286 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2023-08-26 15:18:45,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2023-08-26 15:18:45,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:45,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2023-08-26 15:18:45,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:45,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:45,289 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:45,289 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 178 flow. Second operand 4 states and 455 transitions. [2023-08-26 15:18:45,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 391 flow [2023-08-26 15:18:45,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:18:45,296 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 199 flow [2023-08-26 15:18:45,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-08-26 15:18:45,296 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -13 predicate places. [2023-08-26 15:18:45,296 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 199 flow [2023-08-26 15:18:45,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have 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:18:45,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:45,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:45,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:18:45,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:45,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1310138936, now seen corresponding path program 1 times [2023-08-26 15:18:45,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:45,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617697227] [2023-08-26 15:18:45,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:45,493 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:18:45,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:45,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617697227] [2023-08-26 15:18:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617697227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:45,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:45,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:18:45,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010462896] [2023-08-26 15:18:45,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:45,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:18:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:45,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:18:45,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:18:45,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 303 [2023-08-26 15:18:45,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:45,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:45,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 303 [2023-08-26 15:18:45,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:45,787 INFO L124 PetriNetUnfolderBase]: 1665/2837 cut-off events. [2023-08-26 15:18:45,787 INFO L125 PetriNetUnfolderBase]: For 2294/2306 co-relation queries the response was YES. [2023-08-26 15:18:45,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8534 conditions, 2837 events. 1665/2837 cut-off events. For 2294/2306 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 17924 event pairs, 368 based on Foata normal form. 20/2816 useless extension candidates. Maximal degree in co-relation 8523. Up to 1821 conditions per place. [2023-08-26 15:18:45,797 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 60 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2023-08-26 15:18:45,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 456 flow [2023-08-26 15:18:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:18:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:18:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-08-26 15:18:45,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38613861386138615 [2023-08-26 15:18:45,799 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-08-26 15:18:45,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-08-26 15:18:45,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:45,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-08-26 15:18:45,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:18:45,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:45,801 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:45,801 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 199 flow. Second operand 4 states and 468 transitions. [2023-08-26 15:18:45,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 456 flow [2023-08-26 15:18:45,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 442 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:18:45,810 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 241 flow [2023-08-26 15:18:45,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-26 15:18:45,810 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -11 predicate places. [2023-08-26 15:18:45,811 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 241 flow [2023-08-26 15:18:45,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:45,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:45,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:45,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:18:45,811 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:45,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:45,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1133996350, now seen corresponding path program 1 times [2023-08-26 15:18:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:45,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904650576] [2023-08-26 15:18:45,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:45,967 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:18:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904650576] [2023-08-26 15:18:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904650576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:45,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:45,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:18:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127021246] [2023-08-26 15:18:45,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:45,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:18:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:45,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:18:45,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:18:45,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 303 [2023-08-26 15:18:45,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have 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:18:45,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:45,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 303 [2023-08-26 15:18:45,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:46,229 INFO L124 PetriNetUnfolderBase]: 1416/2315 cut-off events. [2023-08-26 15:18:46,229 INFO L125 PetriNetUnfolderBase]: For 2192/2200 co-relation queries the response was YES. [2023-08-26 15:18:46,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7585 conditions, 2315 events. 1416/2315 cut-off events. For 2192/2200 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 13015 event pairs, 383 based on Foata normal form. 61/2353 useless extension candidates. Maximal degree in co-relation 7572. Up to 907 conditions per place. [2023-08-26 15:18:46,237 INFO L140 encePairwiseOnDemand]: 294/303 looper letters, 61 selfloop transitions, 12 changer transitions 3/78 dead transitions. [2023-08-26 15:18:46,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 553 flow [2023-08-26 15:18:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:18:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:18:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2023-08-26 15:18:46,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3613861386138614 [2023-08-26 15:18:46,239 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2023-08-26 15:18:46,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2023-08-26 15:18:46,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:46,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2023-08-26 15:18:46,240 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:18:46,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have 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:18:46,242 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have 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:18:46,242 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 241 flow. Second operand 6 states and 657 transitions. [2023-08-26 15:18:46,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 553 flow [2023-08-26 15:18:46,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:18:46,249 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 275 flow [2023-08-26 15:18:46,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-08-26 15:18:46,249 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2023-08-26 15:18:46,249 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 275 flow [2023-08-26 15:18:46,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have 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:18:46,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:46,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:46,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:18:46,250 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:46,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:46,250 INFO L85 PathProgramCache]: Analyzing trace with hash -792262899, now seen corresponding path program 1 times [2023-08-26 15:18:46,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:46,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346385489] [2023-08-26 15:18:46,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:46,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:47,042 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:18:47,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:47,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346385489] [2023-08-26 15:18:47,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346385489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:47,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:47,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:18:47,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191879368] [2023-08-26 15:18:47,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:47,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:18:47,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:47,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:18:47,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:18:47,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 303 [2023-08-26 15:18:47,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 94.75) internal successors, (758), 8 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:47,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:47,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 303 [2023-08-26 15:18:47,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:47,489 INFO L124 PetriNetUnfolderBase]: 1686/2736 cut-off events. [2023-08-26 15:18:47,489 INFO L125 PetriNetUnfolderBase]: For 3598/3608 co-relation queries the response was YES. [2023-08-26 15:18:47,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9225 conditions, 2736 events. 1686/2736 cut-off events. For 3598/3608 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15857 event pairs, 841 based on Foata normal form. 14/2727 useless extension candidates. Maximal degree in co-relation 9211. Up to 2325 conditions per place. [2023-08-26 15:18:47,500 INFO L140 encePairwiseOnDemand]: 294/303 looper letters, 66 selfloop transitions, 11 changer transitions 1/80 dead transitions. [2023-08-26 15:18:47,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 583 flow [2023-08-26 15:18:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:18:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:18:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 806 transitions. [2023-08-26 15:18:47,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3325082508250825 [2023-08-26 15:18:47,502 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 806 transitions. [2023-08-26 15:18:47,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 806 transitions. [2023-08-26 15:18:47,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:47,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 806 transitions. [2023-08-26 15:18:47,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.75) internal successors, (806), 8 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have 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:18:47,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have 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:18:47,506 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have 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:18:47,506 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 275 flow. Second operand 8 states and 806 transitions. [2023-08-26 15:18:47,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 583 flow [2023-08-26 15:18:47,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 553 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 15:18:47,516 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 356 flow [2023-08-26 15:18:47,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=356, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-08-26 15:18:47,517 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2023-08-26 15:18:47,517 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 356 flow [2023-08-26 15:18:47,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.75) internal successors, (758), 8 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:47,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:47,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:47,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:18:47,518 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:47,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:47,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2059624905, now seen corresponding path program 2 times [2023-08-26 15:18:47,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:47,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777445604] [2023-08-26 15:18:47,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:47,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:48,298 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:18:48,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777445604] [2023-08-26 15:18:48,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777445604] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:48,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:48,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:18:48,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756313363] [2023-08-26 15:18:48,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:48,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:18:48,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:18:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:18:48,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 303 [2023-08-26 15:18:48,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 356 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:18:48,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:48,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 303 [2023-08-26 15:18:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:48,810 INFO L124 PetriNetUnfolderBase]: 1937/3126 cut-off events. [2023-08-26 15:18:48,811 INFO L125 PetriNetUnfolderBase]: For 4687/4697 co-relation queries the response was YES. [2023-08-26 15:18:48,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10788 conditions, 3126 events. 1937/3126 cut-off events. For 4687/4697 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 18497 event pairs, 427 based on Foata normal form. 14/3120 useless extension candidates. Maximal degree in co-relation 10769. Up to 2344 conditions per place. [2023-08-26 15:18:48,822 INFO L140 encePairwiseOnDemand]: 293/303 looper letters, 72 selfloop transitions, 21 changer transitions 1/96 dead transitions. [2023-08-26 15:18:48,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 740 flow [2023-08-26 15:18:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:18:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:18:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 990 transitions. [2023-08-26 15:18:48,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32673267326732675 [2023-08-26 15:18:48,825 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 990 transitions. [2023-08-26 15:18:48,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 990 transitions. [2023-08-26 15:18:48,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:48,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 990 transitions. [2023-08-26 15:18:48,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have 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:18:48,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have 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:18:48,830 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have 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:18:48,830 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 356 flow. Second operand 10 states and 990 transitions. [2023-08-26 15:18:48,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 740 flow [2023-08-26 15:18:48,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 719 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 15:18:48,846 INFO L231 Difference]: Finished difference. Result has 79 places, 63 transitions, 507 flow [2023-08-26 15:18:48,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=507, PETRI_PLACES=79, PETRI_TRANSITIONS=63} [2023-08-26 15:18:48,846 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2023-08-26 15:18:48,846 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 507 flow [2023-08-26 15:18:48,847 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:18:48,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:48,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:48,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:18:48,847 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:48,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:48,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1688690019, now seen corresponding path program 3 times [2023-08-26 15:18:48,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:48,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815247419] [2023-08-26 15:18:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:48,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:49,589 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:18:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815247419] [2023-08-26 15:18:49,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815247419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:49,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:49,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:18:49,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160465151] [2023-08-26 15:18:49,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:49,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:18:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:49,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:18:49,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:18:49,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 303 [2023-08-26 15:18:49,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 507 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:49,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:49,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 303 [2023-08-26 15:18:49,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:50,185 INFO L124 PetriNetUnfolderBase]: 1919/3104 cut-off events. [2023-08-26 15:18:50,185 INFO L125 PetriNetUnfolderBase]: For 6262/6270 co-relation queries the response was YES. [2023-08-26 15:18:50,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11381 conditions, 3104 events. 1919/3104 cut-off events. For 6262/6270 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 18366 event pairs, 223 based on Foata normal form. 12/3096 useless extension candidates. Maximal degree in co-relation 11358. Up to 1767 conditions per place. [2023-08-26 15:18:50,197 INFO L140 encePairwiseOnDemand]: 295/303 looper letters, 81 selfloop transitions, 33 changer transitions 2/118 dead transitions. [2023-08-26 15:18:50,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 1020 flow [2023-08-26 15:18:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 15:18:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 15:18:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1081 transitions. [2023-08-26 15:18:50,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32433243324332434 [2023-08-26 15:18:50,201 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1081 transitions. [2023-08-26 15:18:50,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1081 transitions. [2023-08-26 15:18:50,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:50,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1081 transitions. [2023-08-26 15:18:50,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.27272727272727) internal successors, (1081), 11 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:50,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 303.0) internal successors, (3636), 12 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have 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:18:50,206 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 303.0) internal successors, (3636), 12 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have 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:18:50,206 INFO L175 Difference]: Start difference. First operand has 79 places, 63 transitions, 507 flow. Second operand 11 states and 1081 transitions. [2023-08-26 15:18:50,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 1020 flow [2023-08-26 15:18:50,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 118 transitions, 981 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-26 15:18:50,231 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 705 flow [2023-08-26 15:18:50,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=705, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2023-08-26 15:18:50,231 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 26 predicate places. [2023-08-26 15:18:50,232 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 705 flow [2023-08-26 15:18:50,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:50,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:50,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:50,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:18:50,232 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:50,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash 794150930, now seen corresponding path program 1 times [2023-08-26 15:18:50,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:50,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821169362] [2023-08-26 15:18:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:50,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:50,412 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:18:50,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:50,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821169362] [2023-08-26 15:18:50,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821169362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:50,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:50,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:18:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056702678] [2023-08-26 15:18:50,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:50,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:18:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:18:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:18:50,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 303 [2023-08-26 15:18:50,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 705 flow. Second operand has 9 states, 9 states have (on average 99.66666666666667) internal successors, (897), 9 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:18:50,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:50,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 303 [2023-08-26 15:18:50,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:50,756 INFO L124 PetriNetUnfolderBase]: 1756/2793 cut-off events. [2023-08-26 15:18:50,756 INFO L125 PetriNetUnfolderBase]: For 8353/8359 co-relation queries the response was YES. [2023-08-26 15:18:50,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11035 conditions, 2793 events. 1756/2793 cut-off events. For 8353/8359 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15593 event pairs, 432 based on Foata normal form. 79/2872 useless extension candidates. Maximal degree in co-relation 11008. Up to 1312 conditions per place. [2023-08-26 15:18:50,766 INFO L140 encePairwiseOnDemand]: 293/303 looper letters, 32 selfloop transitions, 6 changer transitions 64/104 dead transitions. [2023-08-26 15:18:50,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 104 transitions, 1031 flow [2023-08-26 15:18:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:18:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:18:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 841 transitions. [2023-08-26 15:18:50,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34694719471947194 [2023-08-26 15:18:50,769 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 841 transitions. [2023-08-26 15:18:50,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 841 transitions. [2023-08-26 15:18:50,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:50,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 841 transitions. [2023-08-26 15:18:50,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.125) internal successors, (841), 8 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have 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:18:50,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have 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:18:50,773 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have 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:18:50,773 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 705 flow. Second operand 8 states and 841 transitions. [2023-08-26 15:18:50,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 104 transitions, 1031 flow [2023-08-26 15:18:50,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 104 transitions, 963 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-08-26 15:18:50,799 INFO L231 Difference]: Finished difference. Result has 90 places, 36 transitions, 261 flow [2023-08-26 15:18:50,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=261, PETRI_PLACES=90, PETRI_TRANSITIONS=36} [2023-08-26 15:18:50,799 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places. [2023-08-26 15:18:50,799 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 36 transitions, 261 flow [2023-08-26 15:18:50,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.66666666666667) internal successors, (897), 9 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:18:50,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:50,800 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:18:50,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:18:50,800 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:50,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:50,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1425772432, now seen corresponding path program 1 times [2023-08-26 15:18:50,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:50,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5079139] [2023-08-26 15:18:50,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:50,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:50,888 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:18:50,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5079139] [2023-08-26 15:18:50,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5079139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:50,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:50,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:18:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671833171] [2023-08-26 15:18:50,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:50,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:18:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:50,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:18:50,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:18:50,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 303 [2023-08-26 15:18:50,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 36 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have 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:18:50,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:50,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 303 [2023-08-26 15:18:50,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:50,952 INFO L124 PetriNetUnfolderBase]: 209/412 cut-off events. [2023-08-26 15:18:50,952 INFO L125 PetriNetUnfolderBase]: For 1158/1158 co-relation queries the response was YES. [2023-08-26 15:18:50,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 412 events. 209/412 cut-off events. For 1158/1158 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1866 event pairs, 45 based on Foata normal form. 14/422 useless extension candidates. Maximal degree in co-relation 1362. Up to 333 conditions per place. [2023-08-26 15:18:50,954 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 36 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-26 15:18:50,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 52 transitions, 465 flow [2023-08-26 15:18:50,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:18:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:18:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-08-26 15:18:50,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43014301430143015 [2023-08-26 15:18:50,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-08-26 15:18:50,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-08-26 15:18:50,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:50,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-08-26 15:18:50,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have 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:18:50,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:18:50,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:18:50,958 INFO L175 Difference]: Start difference. First operand has 90 places, 36 transitions, 261 flow. Second operand 3 states and 391 transitions. [2023-08-26 15:18:50,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 52 transitions, 465 flow [2023-08-26 15:18:50,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 52 transitions, 416 flow, removed 3 selfloop flow, removed 10 redundant places. [2023-08-26 15:18:50,960 INFO L231 Difference]: Finished difference. Result has 67 places, 39 transitions, 248 flow [2023-08-26 15:18:50,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=39} [2023-08-26 15:18:50,960 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2023-08-26 15:18:50,960 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 39 transitions, 248 flow [2023-08-26 15:18:50,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have 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:18:50,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:50,961 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:18:50,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:18:50,961 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:50,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash -163063653, now seen corresponding path program 1 times [2023-08-26 15:18:50,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:50,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809589846] [2023-08-26 15:18:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:50,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:51,052 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:18:51,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:51,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809589846] [2023-08-26 15:18:51,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809589846] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:51,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:51,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:18:51,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780563018] [2023-08-26 15:18:51,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:51,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:18:51,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:51,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:18:51,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:18:51,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 303 [2023-08-26 15:18:51,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 39 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have 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:18:51,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:51,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 303 [2023-08-26 15:18:51,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:51,112 INFO L124 PetriNetUnfolderBase]: 118/267 cut-off events. [2023-08-26 15:18:51,112 INFO L125 PetriNetUnfolderBase]: For 587/587 co-relation queries the response was YES. [2023-08-26 15:18:51,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 267 events. 118/267 cut-off events. For 587/587 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1122 event pairs, 13 based on Foata normal form. 23/286 useless extension candidates. Maximal degree in co-relation 1020. Up to 100 conditions per place. [2023-08-26 15:18:51,114 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 42 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2023-08-26 15:18:51,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 516 flow [2023-08-26 15:18:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:18:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:18:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-26 15:18:51,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.429042904290429 [2023-08-26 15:18:51,115 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-26 15:18:51,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-26 15:18:51,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:51,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-26 15:18:51,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have 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:18:51,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:51,118 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:51,118 INFO L175 Difference]: Start difference. First operand has 67 places, 39 transitions, 248 flow. Second operand 4 states and 520 transitions. [2023-08-26 15:18:51,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 516 flow [2023-08-26 15:18:51,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 61 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:18:51,119 INFO L231 Difference]: Finished difference. Result has 70 places, 42 transitions, 284 flow [2023-08-26 15:18:51,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=70, PETRI_TRANSITIONS=42} [2023-08-26 15:18:51,120 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 4 predicate places. [2023-08-26 15:18:51,120 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 42 transitions, 284 flow [2023-08-26 15:18:51,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have 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:18:51,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:51,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:51,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:18:51,120 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:51,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash -55378197, now seen corresponding path program 1 times [2023-08-26 15:18:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473530745] [2023-08-26 15:18:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:51,201 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:18:51,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473530745] [2023-08-26 15:18:51,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473530745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:51,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:51,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:18:51,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491719971] [2023-08-26 15:18:51,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:51,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:18:51,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:51,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:18:51,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:18:51,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 303 [2023-08-26 15:18:51,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 42 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:51,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:51,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 303 [2023-08-26 15:18:51,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:51,281 INFO L124 PetriNetUnfolderBase]: 235/522 cut-off events. [2023-08-26 15:18:51,282 INFO L125 PetriNetUnfolderBase]: For 1424/1424 co-relation queries the response was YES. [2023-08-26 15:18:51,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 522 events. 235/522 cut-off events. For 1424/1424 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2730 event pairs, 46 based on Foata normal form. 5/525 useless extension candidates. Maximal degree in co-relation 2012. Up to 237 conditions per place. [2023-08-26 15:18:51,284 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 48 selfloop transitions, 2 changer transitions 6/67 dead transitions. [2023-08-26 15:18:51,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 581 flow [2023-08-26 15:18:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:18:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:18:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-26 15:18:51,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.429042904290429 [2023-08-26 15:18:51,285 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-26 15:18:51,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-26 15:18:51,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:51,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-26 15:18:51,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have 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:18:51,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:51,288 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:18:51,288 INFO L175 Difference]: Start difference. First operand has 70 places, 42 transitions, 284 flow. Second operand 4 states and 520 transitions. [2023-08-26 15:18:51,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 581 flow [2023-08-26 15:18:51,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 554 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-26 15:18:51,290 INFO L231 Difference]: Finished difference. Result has 73 places, 43 transitions, 283 flow [2023-08-26 15:18:51,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=73, PETRI_TRANSITIONS=43} [2023-08-26 15:18:51,290 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2023-08-26 15:18:51,290 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 43 transitions, 283 flow [2023-08-26 15:18:51,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:51,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:51,291 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:18:51,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:18:51,291 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:51,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1403173185, now seen corresponding path program 2 times [2023-08-26 15:18:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:51,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475570906] [2023-08-26 15:18:51,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:51,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:18:51,389 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:18:51,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:18:51,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475570906] [2023-08-26 15:18:51,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475570906] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:18:51,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:18:51,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:18:51,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440956957] [2023-08-26 15:18:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:18:51,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:18:51,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:18:51,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:18:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:18:51,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 303 [2023-08-26 15:18:51,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 43 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have 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:18:51,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:18:51,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 303 [2023-08-26 15:18:51,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:18:51,455 INFO L124 PetriNetUnfolderBase]: 145/331 cut-off events. [2023-08-26 15:18:51,456 INFO L125 PetriNetUnfolderBase]: For 957/973 co-relation queries the response was YES. [2023-08-26 15:18:51,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 331 events. 145/331 cut-off events. For 957/973 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1667 event pairs, 15 based on Foata normal form. 32/345 useless extension candidates. Maximal degree in co-relation 1299. Up to 134 conditions per place. [2023-08-26 15:18:51,457 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 32 selfloop transitions, 10 changer transitions 9/62 dead transitions. [2023-08-26 15:18:51,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 62 transitions, 542 flow [2023-08-26 15:18:51,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:18:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:18:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-26 15:18:51,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4231023102310231 [2023-08-26 15:18:51,459 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-26 15:18:51,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-26 15:18:51,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:18:51,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-26 15:18:51,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:18:51,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have 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:18:51,462 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have 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:18:51,462 INFO L175 Difference]: Start difference. First operand has 73 places, 43 transitions, 283 flow. Second operand 5 states and 641 transitions. [2023-08-26 15:18:51,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 62 transitions, 542 flow [2023-08-26 15:18:51,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 62 transitions, 506 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-26 15:18:51,464 INFO L231 Difference]: Finished difference. Result has 74 places, 40 transitions, 266 flow [2023-08-26 15:18:51,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=74, PETRI_TRANSITIONS=40} [2023-08-26 15:18:51,464 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2023-08-26 15:18:51,464 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 40 transitions, 266 flow [2023-08-26 15:18:51,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have 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:18:51,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:18:51,465 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:18:51,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 15:18:51,465 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-08-26 15:18:51,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:18:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash 78439819, now seen corresponding path program 1 times [2023-08-26 15:18:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:18:51,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357341807] [2023-08-26 15:18:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:18:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:18:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:18:51,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:18:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:18:51,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:18:51,537 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:18:51,537 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (51 of 52 remaining) [2023-08-26 15:18:51,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 52 remaining) [2023-08-26 15:18:51,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 52 remaining) [2023-08-26 15:18:51,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 52 remaining) [2023-08-26 15:18:51,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 52 remaining) [2023-08-26 15:18:51,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 52 remaining) [2023-08-26 15:18:51,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 52 remaining) [2023-08-26 15:18:51,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 52 remaining) [2023-08-26 15:18:51,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 52 remaining) [2023-08-26 15:18:51,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 52 remaining) [2023-08-26 15:18:51,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 52 remaining) [2023-08-26 15:18:51,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 52 remaining) [2023-08-26 15:18:51,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 52 remaining) [2023-08-26 15:18:51,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 52 remaining) [2023-08-26 15:18:51,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 52 remaining) [2023-08-26 15:18:51,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 15:18:51,543 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:18:51,547 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:18:51,547 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:18:51,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:18:51 BasicIcfg [2023-08-26 15:18:51,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:18:51,599 INFO L158 Benchmark]: Toolchain (without parser) took 18160.17ms. Allocated memory was 392.2MB in the beginning and 872.4MB in the end (delta: 480.2MB). Free memory was 346.3MB in the beginning and 508.2MB in the end (delta: -161.8MB). Peak memory consumption was 319.5MB. Max. memory is 16.0GB. [2023-08-26 15:18:51,599 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 392.2MB. Free memory was 368.5MB in the beginning and 368.5MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:18:51,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.98ms. Allocated memory is still 392.2MB. Free memory was 346.0MB in the beginning and 323.4MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:18:51,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.94ms. Allocated memory is still 392.2MB. Free memory was 323.4MB in the beginning and 369.4MB in the end (delta: -46.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.0GB. [2023-08-26 15:18:51,600 INFO L158 Benchmark]: Boogie Preprocessor took 39.36ms. Allocated memory is still 392.2MB. Free memory was 369.4MB in the beginning and 367.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:18:51,600 INFO L158 Benchmark]: RCFGBuilder took 724.60ms. Allocated memory is still 392.2MB. Free memory was 367.0MB in the beginning and 351.7MB in the end (delta: 15.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.0GB. [2023-08-26 15:18:51,600 INFO L158 Benchmark]: TraceAbstraction took 16890.38ms. Allocated memory was 392.2MB in the beginning and 872.4MB in the end (delta: 480.2MB). Free memory was 350.6MB in the beginning and 508.2MB in the end (delta: -157.5MB). Peak memory consumption was 322.7MB. Max. memory is 16.0GB. [2023-08-26 15:18:51,601 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 392.2MB. Free memory was 368.5MB in the beginning and 368.5MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 423.98ms. Allocated memory is still 392.2MB. Free memory was 346.0MB in the beginning and 323.4MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 75.94ms. Allocated memory is still 392.2MB. Free memory was 323.4MB in the beginning and 369.4MB in the end (delta: -46.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.36ms. Allocated memory is still 392.2MB. Free memory was 369.4MB in the beginning and 367.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 724.60ms. Allocated memory is still 392.2MB. Free memory was 367.0MB in the beginning and 351.7MB in the end (delta: 15.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.0GB. * TraceAbstraction took 16890.38ms. Allocated memory was 392.2MB in the beginning and 872.4MB in the end (delta: 480.2MB). Free memory was 350.6MB in the beginning and 508.2MB in the end (delta: -157.5MB). Peak memory consumption was 322.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 163 PlacesBefore, 66 PlacesAfterwards, 156 TransitionsBefore, 57 TransitionsAfterwards, 4482 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 144 TotalNumberOfCompositions, 16959 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6131, independent: 5738, independent conditional: 0, independent unconditional: 5738, dependent: 393, dependent conditional: 0, dependent unconditional: 393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2184, independent: 2107, independent conditional: 0, independent unconditional: 2107, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6131, independent: 3631, independent conditional: 0, independent unconditional: 3631, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 2184, unknown conditional: 0, unknown unconditional: 2184] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 296, Positive conditional cache size: 0, Positive unconditional cache size: 296, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t2061; [L837] FCALL, FORK 0 pthread_create(&t2061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2061, ((void *)0), P0, ((void *)0))=-2, t2061={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L781] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] 0 pthread_t t2062; [L839] FCALL, FORK 0 pthread_create(&t2062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2062, ((void *)0), P1, ((void *)0))=-1, t2061={7:0}, t2062={8:0}, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L793] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] 0 pthread_t t2063; [L841] FCALL, FORK 0 pthread_create(&t2063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2063, ((void *)0), P2, ((void *)0))=0, t2061={7:0}, t2062={8:0}, t2063={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L796] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L808] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L811] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2061={7:0}, t2062={8:0}, t2063={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe012_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 841]: 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, 200 locations, 52 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 614 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1586 IncrementalHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 17 mSDtfsCounter, 1586 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=705occurred in iteration=14, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 2690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:18:51,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...