/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/safe015_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:18:56,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:18:56,516 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:56,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:18:56,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:18:56,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:18:56,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:18:56,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:18:56,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:18:56,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:18:56,540 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:18:56,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:18:56,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:18:56,541 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:18:56,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:18:56,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:18:56,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:18:56,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:18:56,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:18:56,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:18:56,543 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:18:56,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:18:56,545 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:18:56,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:18:56,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:18:56,546 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:18:56,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:18:56,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:18:56,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:18:56,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:18:56,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:18:56,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:18:56,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:18:56,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:18:56,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:18:56,548 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:56,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:18:56,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:18:56,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:18:56,883 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:18:56,884 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:18:56,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_power.oepc.i [2023-08-26 15:18:58,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:18:58,331 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:18:58,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.oepc.i [2023-08-26 15:18:58,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1736c6e32/89a4ef01a82f4a048efe9ae84d749a32/FLAG623a0ce42 [2023-08-26 15:18:58,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1736c6e32/89a4ef01a82f4a048efe9ae84d749a32 [2023-08-26 15:18:58,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:18:58,379 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:18:58,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:18:58,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:18:58,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:18:58,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:18:58" (1/1) ... [2023-08-26 15:18:58,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45307275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:58, skipping insertion in model container [2023-08-26 15:18:58,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:18:58" (1/1) ... [2023-08-26 15:18:58,439 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:18:58,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:18:58,864 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:18:58,893 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:18:58,895 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:18:58,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:18:58,980 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:18:58,981 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:18:58,986 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:18:58,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:58 WrapperNode [2023-08-26 15:18:58,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:18:58,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:18:58,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:18:58,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:18:58,996 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:58" (1/1) ... [2023-08-26 15:18:59,027 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:58" (1/1) ... [2023-08-26 15:18:59,071 INFO L138 Inliner]: procedures = 176, calls = 87, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 237 [2023-08-26 15:18:59,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:18:59,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:18:59,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:18:59,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:18:59,080 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:58" (1/1) ... [2023-08-26 15:18:59,080 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:58" (1/1) ... [2023-08-26 15:18:59,087 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:58" (1/1) ... [2023-08-26 15:18:59,087 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:58" (1/1) ... [2023-08-26 15:18:59,108 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:58" (1/1) ... [2023-08-26 15:18:59,110 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:58" (1/1) ... [2023-08-26 15:18:59,113 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:58" (1/1) ... [2023-08-26 15:18:59,114 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:58" (1/1) ... [2023-08-26 15:18:59,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:18:59,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:18:59,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:18:59,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:18:59,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:58" (1/1) ... [2023-08-26 15:18:59,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:18:59,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:18:59,171 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:59,180 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:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 15:18:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:18:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:18:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:18:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:18:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:18:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:18:59,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:18:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:18:59,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:18:59,204 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:18:59,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:18:59,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:18:59,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:18:59,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:18:59,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:18:59,206 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:59,371 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:18:59,373 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:18:59,931 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:19:00,706 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:19:00,706 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:19:00,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:19:00 BoogieIcfgContainer [2023-08-26 15:19:00,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:19:00,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:19:00,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:19:00,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:19:00,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:18:58" (1/3) ... [2023-08-26 15:19:00,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdbecb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:19:00, skipping insertion in model container [2023-08-26 15:19:00,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:18:58" (2/3) ... [2023-08-26 15:19:00,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdbecb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:19:00, skipping insertion in model container [2023-08-26 15:19:00,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:19:00" (3/3) ... [2023-08-26 15:19:00,719 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.oepc.i [2023-08-26 15:19:00,733 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:19:00,734 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2023-08-26 15:19:00,734 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:19:00,911 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:19:00,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 190 transitions, 395 flow [2023-08-26 15:19:01,046 INFO L124 PetriNetUnfolderBase]: 3/187 cut-off events. [2023-08-26 15:19:01,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:19:01,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 187 events. 3/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 370 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 131. Up to 2 conditions per place. [2023-08-26 15:19:01,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 190 transitions, 395 flow [2023-08-26 15:19:01,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 187 transitions, 383 flow [2023-08-26 15:19:01,065 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:19:01,076 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 187 transitions, 383 flow [2023-08-26 15:19:01,081 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 187 transitions, 383 flow [2023-08-26 15:19:01,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 187 transitions, 383 flow [2023-08-26 15:19:01,149 INFO L124 PetriNetUnfolderBase]: 3/187 cut-off events. [2023-08-26 15:19:01,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:19:01,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 187 events. 3/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 370 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 131. Up to 2 conditions per place. [2023-08-26 15:19:01,155 INFO L119 LiptonReduction]: Number of co-enabled transitions 8940 [2023-08-26 15:19:17,984 INFO L134 LiptonReduction]: Checked pairs total: 67415 [2023-08-26 15:19:17,985 INFO L136 LiptonReduction]: Total number of compositions: 145 [2023-08-26 15:19:17,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:19:18,002 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;@7b301317, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:19:18,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-08-26 15:19:18,003 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:19:18,003 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:19:18,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:19:18,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:19:18,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:19:18,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-26 15:19:18,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:19:18,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1439, now seen corresponding path program 1 times [2023-08-26 15:19:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:19:18,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740009840] [2023-08-26 15:19:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:19:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:19:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:19:18,132 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:19:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:19:18,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740009840] [2023-08-26 15:19:18,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740009840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:19:18,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:19:18,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:19:18,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727621373] [2023-08-26 15:19:18,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:19:18,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:19:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:19:18,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:19:18,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:19:18,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 335 [2023-08-26 15:19:18,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 193 flow. Second operand has 2 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:18,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:19:18,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 335 [2023-08-26 15:19:18,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:19:23,116 INFO L124 PetriNetUnfolderBase]: 25861/36638 cut-off events. [2023-08-26 15:19:23,116 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-08-26 15:19:23,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72767 conditions, 36638 events. 25861/36638 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2944. Compared 254290 event pairs, 25861 based on Foata normal form. 0/15746 useless extension candidates. Maximal degree in co-relation 72756. Up to 35979 conditions per place. [2023-08-26 15:19:23,358 INFO L140 encePairwiseOnDemand]: 293/335 looper letters, 46 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2023-08-26 15:19:23,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 197 flow [2023-08-26 15:19:23,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:19:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:19:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 326 transitions. [2023-08-26 15:19:23,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48656716417910445 [2023-08-26 15:19:23,373 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 326 transitions. [2023-08-26 15:19:23,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 326 transitions. [2023-08-26 15:19:23,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:19:23,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 326 transitions. [2023-08-26 15:19:23,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 163.0) internal successors, (326), 2 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:23,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:23,386 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:23,388 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 193 flow. Second operand 2 states and 326 transitions. [2023-08-26 15:19:23,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 197 flow [2023-08-26 15:19:23,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:19:23,395 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 102 flow [2023-08-26 15:19:23,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-26 15:19:23,401 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -44 predicate places. [2023-08-26 15:19:23,401 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 102 flow [2023-08-26 15:19:23,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:23,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:19:23,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 15:19:23,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:19:23,402 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-26 15:19:23,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:19:23,411 INFO L85 PathProgramCache]: Analyzing trace with hash 44062898, now seen corresponding path program 1 times [2023-08-26 15:19:23,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:19:23,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20022942] [2023-08-26 15:19:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:19:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:19:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:19:23,710 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:19:23,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:19:23,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20022942] [2023-08-26 15:19:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20022942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:19:23,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:19:23,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:19:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348870793] [2023-08-26 15:19:23,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:19:23,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:19:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:19:23,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:19:23,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:19:23,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 335 [2023-08-26 15:19:23,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:23,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:19:23,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 335 [2023-08-26 15:19:23,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:19:25,694 INFO L124 PetriNetUnfolderBase]: 9550/13796 cut-off events. [2023-08-26 15:19:25,694 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:19:25,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27382 conditions, 13796 events. 9550/13796 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 985. Compared 85321 event pairs, 9550 based on Foata normal form. 0/7670 useless extension candidates. Maximal degree in co-relation 27379. Up to 13481 conditions per place. [2023-08-26 15:19:25,762 INFO L140 encePairwiseOnDemand]: 325/335 looper letters, 36 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-26 15:19:25,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 158 flow [2023-08-26 15:19:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:19:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:19:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 15:19:25,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3592039800995025 [2023-08-26 15:19:25,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 15:19:25,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 15:19:25,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:19:25,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 15:19:25,772 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:19:25,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:25,777 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:25,778 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 102 flow. Second operand 3 states and 361 transitions. [2023-08-26 15:19:25,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 158 flow [2023-08-26 15:19:25,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:19:25,782 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 86 flow [2023-08-26 15:19:25,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-26 15:19:25,784 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -51 predicate places. [2023-08-26 15:19:25,784 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 86 flow [2023-08-26 15:19:25,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:25,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:19:25,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 15:19:25,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:19:25,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-26 15:19:25,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:19:25,786 INFO L85 PathProgramCache]: Analyzing trace with hash 44062897, now seen corresponding path program 1 times [2023-08-26 15:19:25,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:19:25,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620609753] [2023-08-26 15:19:25,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:19:25,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:19:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:19:25,872 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:19:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:19:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620609753] [2023-08-26 15:19:25,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620609753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:19:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:19:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:19:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654783733] [2023-08-26 15:19:25,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:19:25,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:19:25,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:19:25,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:19:25,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:19:25,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 335 [2023-08-26 15:19:25,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:25,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:19:25,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 335 [2023-08-26 15:19:25,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:19:26,866 INFO L124 PetriNetUnfolderBase]: 5044/7726 cut-off events. [2023-08-26 15:19:26,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:19:26,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15360 conditions, 7726 events. 5044/7726 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 46139 event pairs, 3163 based on Foata normal form. 0/5962 useless extension candidates. Maximal degree in co-relation 15356. Up to 4517 conditions per place. [2023-08-26 15:19:26,902 INFO L140 encePairwiseOnDemand]: 318/335 looper letters, 41 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2023-08-26 15:19:26,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 206 flow [2023-08-26 15:19:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:19:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:19:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 15:19:26,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3592039800995025 [2023-08-26 15:19:26,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 15:19:26,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 15:19:26,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:19:26,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 15:19:26,906 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:19:26,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:26,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:26,909 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 86 flow. Second operand 3 states and 361 transitions. [2023-08-26 15:19:26,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 206 flow [2023-08-26 15:19:26,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:19:26,910 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 147 flow [2023-08-26 15:19:26,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-26 15:19:26,911 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -51 predicate places. [2023-08-26 15:19:26,911 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 147 flow [2023-08-26 15:19:26,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:26,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:19:26,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 15:19:26,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:19:26,912 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-26 15:19:26,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:19:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash -603215672, now seen corresponding path program 1 times [2023-08-26 15:19:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:19:26,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327781378] [2023-08-26 15:19:26,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:19:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:19:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:19:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:19:27,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:19:27,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327781378] [2023-08-26 15:19:27,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327781378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:19:27,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:19:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:19:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267999940] [2023-08-26 15:19:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:19:27,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:19:27,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:19:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:19:27,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:19:27,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 335 [2023-08-26 15:19:27,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:27,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:19:27,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 335 [2023-08-26 15:19:27,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:19:27,948 INFO L124 PetriNetUnfolderBase]: 4242/6527 cut-off events. [2023-08-26 15:19:27,948 INFO L125 PetriNetUnfolderBase]: For 2004/2040 co-relation queries the response was YES. [2023-08-26 15:19:27,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17196 conditions, 6527 events. 4242/6527 cut-off events. For 2004/2040 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 39407 event pairs, 1517 based on Foata normal form. 36/5726 useless extension candidates. Maximal degree in co-relation 17191. Up to 5707 conditions per place. [2023-08-26 15:19:27,982 INFO L140 encePairwiseOnDemand]: 332/335 looper letters, 63 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-26 15:19:27,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 367 flow [2023-08-26 15:19:27,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:19:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:19:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-26 15:19:27,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40696517412935324 [2023-08-26 15:19:27,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-26 15:19:27,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-26 15:19:27,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:19:27,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-26 15:19:27,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:27,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:27,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:27,988 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 147 flow. Second operand 3 states and 409 transitions. [2023-08-26 15:19:27,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 367 flow [2023-08-26 15:19:28,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:19:28,007 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 133 flow [2023-08-26 15:19:28,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-08-26 15:19:28,009 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -52 predicate places. [2023-08-26 15:19:28,009 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 133 flow [2023-08-26 15:19:28,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:28,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:19:28,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:19:28,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:19:28,010 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-26 15:19:28,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:19:28,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1519815396, now seen corresponding path program 1 times [2023-08-26 15:19:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:19:28,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765191324] [2023-08-26 15:19:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:19:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:19:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:19:28,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:19:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:19:28,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:19:28,087 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:19:28,088 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err1ASSERT_VIOLATIONASSERT (103 of 104 remaining) [2023-08-26 15:19:28,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 104 remaining) [2023-08-26 15:19:28,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 104 remaining) [2023-08-26 15:19:28,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 104 remaining) [2023-08-26 15:19:28,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 104 remaining) [2023-08-26 15:19:28,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 104 remaining) [2023-08-26 15:19:28,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 104 remaining) [2023-08-26 15:19:28,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 104 remaining) [2023-08-26 15:19:28,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 104 remaining) [2023-08-26 15:19:28,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 104 remaining) [2023-08-26 15:19:28,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 104 remaining) [2023-08-26 15:19:28,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 104 remaining) [2023-08-26 15:19:28,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 104 remaining) [2023-08-26 15:19:28,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (90 of 104 remaining) [2023-08-26 15:19:28,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONASSERT (89 of 104 remaining) [2023-08-26 15:19:28,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 104 remaining) [2023-08-26 15:19:28,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 104 remaining) [2023-08-26 15:19:28,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 104 remaining) [2023-08-26 15:19:28,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 104 remaining) [2023-08-26 15:19:28,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 104 remaining) [2023-08-26 15:19:28,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 104 remaining) [2023-08-26 15:19:28,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 104 remaining) [2023-08-26 15:19:28,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 104 remaining) [2023-08-26 15:19:28,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 104 remaining) [2023-08-26 15:19:28,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 104 remaining) [2023-08-26 15:19:28,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 104 remaining) [2023-08-26 15:19:28,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 104 remaining) [2023-08-26 15:19:28,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 104 remaining) [2023-08-26 15:19:28,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 104 remaining) [2023-08-26 15:19:28,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 104 remaining) [2023-08-26 15:19:28,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 104 remaining) [2023-08-26 15:19:28,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 104 remaining) [2023-08-26 15:19:28,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 104 remaining) [2023-08-26 15:19:28,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 104 remaining) [2023-08-26 15:19:28,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 104 remaining) [2023-08-26 15:19:28,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 104 remaining) [2023-08-26 15:19:28,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 104 remaining) [2023-08-26 15:19:28,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 104 remaining) [2023-08-26 15:19:28,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 104 remaining) [2023-08-26 15:19:28,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 104 remaining) [2023-08-26 15:19:28,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 104 remaining) [2023-08-26 15:19:28,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 104 remaining) [2023-08-26 15:19:28,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 104 remaining) [2023-08-26 15:19:28,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 104 remaining) [2023-08-26 15:19:28,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 104 remaining) [2023-08-26 15:19:28,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 104 remaining) [2023-08-26 15:19:28,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 104 remaining) [2023-08-26 15:19:28,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 104 remaining) [2023-08-26 15:19:28,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 104 remaining) [2023-08-26 15:19:28,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 104 remaining) [2023-08-26 15:19:28,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 104 remaining) [2023-08-26 15:19:28,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 104 remaining) [2023-08-26 15:19:28,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 104 remaining) [2023-08-26 15:19:28,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 104 remaining) [2023-08-26 15:19:28,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 104 remaining) [2023-08-26 15:19:28,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 104 remaining) [2023-08-26 15:19:28,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 104 remaining) [2023-08-26 15:19:28,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 104 remaining) [2023-08-26 15:19:28,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 104 remaining) [2023-08-26 15:19:28,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 104 remaining) [2023-08-26 15:19:28,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 104 remaining) [2023-08-26 15:19:28,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 104 remaining) [2023-08-26 15:19:28,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 104 remaining) [2023-08-26 15:19:28,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (40 of 104 remaining) [2023-08-26 15:19:28,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 104 remaining) [2023-08-26 15:19:28,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 104 remaining) [2023-08-26 15:19:28,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 104 remaining) [2023-08-26 15:19:28,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 104 remaining) [2023-08-26 15:19:28,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 104 remaining) [2023-08-26 15:19:28,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 104 remaining) [2023-08-26 15:19:28,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 104 remaining) [2023-08-26 15:19:28,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 104 remaining) [2023-08-26 15:19:28,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 104 remaining) [2023-08-26 15:19:28,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 104 remaining) [2023-08-26 15:19:28,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 104 remaining) [2023-08-26 15:19:28,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 104 remaining) [2023-08-26 15:19:28,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 104 remaining) [2023-08-26 15:19:28,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 104 remaining) [2023-08-26 15:19:28,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 104 remaining) [2023-08-26 15:19:28,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (24 of 104 remaining) [2023-08-26 15:19:28,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 104 remaining) [2023-08-26 15:19:28,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 104 remaining) [2023-08-26 15:19:28,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 104 remaining) [2023-08-26 15:19:28,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 104 remaining) [2023-08-26 15:19:28,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 104 remaining) [2023-08-26 15:19:28,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 104 remaining) [2023-08-26 15:19:28,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 104 remaining) [2023-08-26 15:19:28,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 104 remaining) [2023-08-26 15:19:28,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 104 remaining) [2023-08-26 15:19:28,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 104 remaining) [2023-08-26 15:19:28,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 104 remaining) [2023-08-26 15:19:28,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 104 remaining) [2023-08-26 15:19:28,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 104 remaining) [2023-08-26 15:19:28,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 104 remaining) [2023-08-26 15:19:28,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 104 remaining) [2023-08-26 15:19:28,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 104 remaining) [2023-08-26 15:19:28,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 104 remaining) [2023-08-26 15:19:28,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 104 remaining) [2023-08-26 15:19:28,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 104 remaining) [2023-08-26 15:19:28,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 104 remaining) [2023-08-26 15:19:28,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 104 remaining) [2023-08-26 15:19:28,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 104 remaining) [2023-08-26 15:19:28,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 104 remaining) [2023-08-26 15:19:28,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 104 remaining) [2023-08-26 15:19:28,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:19:28,116 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-26 15:19:28,122 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:19:28,122 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:19:28,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:19:28 BasicIcfg [2023-08-26 15:19:28,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:19:28,162 INFO L158 Benchmark]: Toolchain (without parser) took 29782.95ms. Allocated memory was 333.4MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 308.5MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 548.8MB. Max. memory is 16.0GB. [2023-08-26 15:19:28,162 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 333.4MB. Free memory is still 311.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:19:28,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.08ms. Allocated memory is still 333.4MB. Free memory was 308.5MB in the beginning and 281.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-26 15:19:28,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.06ms. Allocated memory is still 333.4MB. Free memory was 281.2MB in the beginning and 278.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:19:28,163 INFO L158 Benchmark]: Boogie Preprocessor took 45.42ms. Allocated memory is still 333.4MB. Free memory was 278.1MB in the beginning and 275.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:19:28,163 INFO L158 Benchmark]: RCFGBuilder took 1590.27ms. Allocated memory was 333.4MB in the beginning and 419.4MB in the end (delta: 86.0MB). Free memory was 275.5MB in the beginning and 273.3MB in the end (delta: 2.2MB). Peak memory consumption was 89.1MB. Max. memory is 16.0GB. [2023-08-26 15:19:28,164 INFO L158 Benchmark]: TraceAbstraction took 27449.40ms. Allocated memory was 419.4MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 272.3MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 428.2MB. Max. memory is 16.0GB. [2023-08-26 15:19:28,169 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.16ms. Allocated memory is still 333.4MB. Free memory is still 311.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 609.08ms. Allocated memory is still 333.4MB. Free memory was 308.5MB in the beginning and 281.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 82.06ms. Allocated memory is still 333.4MB. Free memory was 281.2MB in the beginning and 278.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.42ms. Allocated memory is still 333.4MB. Free memory was 278.1MB in the beginning and 275.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1590.27ms. Allocated memory was 333.4MB in the beginning and 419.4MB in the end (delta: 86.0MB). Free memory was 275.5MB in the beginning and 273.3MB in the end (delta: 2.2MB). Peak memory consumption was 89.1MB. Max. memory is 16.0GB. * TraceAbstraction took 27449.40ms. Allocated memory was 419.4MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 272.3MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 428.2MB. 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: 16.9s, 194 PlacesBefore, 100 PlacesAfterwards, 187 TransitionsBefore, 92 TransitionsAfterwards, 8940 CoEnabledTransitionPairs, 8 FixpointIterations, 62 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 67415 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15201, independent: 14179, independent conditional: 0, independent unconditional: 14179, dependent: 1022, dependent conditional: 0, dependent unconditional: 1022, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3081, independent: 2943, independent conditional: 0, independent unconditional: 2943, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15201, independent: 11236, independent conditional: 0, independent unconditional: 11236, dependent: 884, dependent conditional: 0, dependent unconditional: 884, unknown: 3081, unknown conditional: 0, unknown unconditional: 3081] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 402, Positive conditional cache size: 0, Positive unconditional cache size: 402, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, 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; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2121; [L872] FCALL, FORK 0 pthread_create(&t2121, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2121, ((void *)0), P0, ((void *)0))=-1, t2121={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L873] 0 pthread_t t2122; [L874] FCALL, FORK 0 pthread_create(&t2122, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2122, ((void *)0), P1, ((void *)0))=0, t2121={6:0}, t2122={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L801] 2 x$w_buff1 = x$w_buff0 [L802] 2 x$w_buff0 = 2 [L803] 2 x$w_buff1_used = x$w_buff0_used [L804] 2 x$w_buff0_used = (_Bool)1 [L805] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 2 !expression [L19] CALL 2 reach_error() [L18] COND FALSE 2 !(0) [L18] 2 __assert_fail ("0", "safe015_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x={3:0}, y=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: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 872]: 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: 876]: 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, 252 locations, 104 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: 27.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 206 IncrementalHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 0 mSDtfsCounter, 206 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=0, InterpolantAutomatonStates: 11, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 57 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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:19:28,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...