/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:31:03,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:31:03,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:31:03,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:31:03,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:31:03,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:31:03,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:31:03,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:31:03,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:31:03,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:31:03,110 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:31:03,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:31:03,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:31:03,111 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:31:03,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:31:03,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:31:03,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:31:03,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:31:03,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:31:03,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:31:03,113 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:31:03,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:31:03,114 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:31:03,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:31:03,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:31:03,115 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:31:03,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:31:03,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:31:03,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:31:03,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:31:03,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:31:03,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:31:03,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:31:03,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:31:03,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:31:03,118 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:31:03,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:31:03,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:31:03,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:31:03,478 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:31:03,479 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:31:03,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-08-26 18:31:04,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:31:04,962 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:31:04,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-08-26 18:31:04,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e131d04cd/41a6073591c94fc3923c019f877a0de6/FLAG1247d56ac [2023-08-26 18:31:04,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e131d04cd/41a6073591c94fc3923c019f877a0de6 [2023-08-26 18:31:04,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:31:04,999 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:31:05,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:31:05,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:31:05,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:31:05,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:31:04" (1/1) ... [2023-08-26 18:31:05,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6423a037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:05, skipping insertion in model container [2023-08-26 18:31:05,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:31:04" (1/1) ... [2023-08-26 18:31:05,056 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:31:05,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:31:05,891 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:31:05,909 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [127] [2023-08-26 18:31:05,924 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [524] [2023-08-26 18:31:05,925 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [525] [2023-08-26 18:31:05,945 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1797] [2023-08-26 18:31:05,945 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1798] [2023-08-26 18:31:05,946 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1799] [2023-08-26 18:31:05,946 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1800] [2023-08-26 18:31:05,946 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1802] [2023-08-26 18:31:05,946 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1805] [2023-08-26 18:31:05,947 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1805] [2023-08-26 18:31:05,947 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1805] [2023-08-26 18:31:05,947 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1807] [2023-08-26 18:31:05,948 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1812] [2023-08-26 18:31:05,948 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1812] [2023-08-26 18:31:05,948 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1812] [2023-08-26 18:31:05,949 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1825] [2023-08-26 18:31:05,950 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1825] [2023-08-26 18:31:05,950 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1826] [2023-08-26 18:31:05,951 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1830] [2023-08-26 18:31:05,952 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1830] [2023-08-26 18:31:05,952 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1833] [2023-08-26 18:31:05,956 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1845] [2023-08-26 18:31:05,958 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1848] [2023-08-26 18:31:05,966 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1861] [2023-08-26 18:31:05,968 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1864] [2023-08-26 18:31:05,970 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1880] [2023-08-26 18:31:05,971 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1883] [2023-08-26 18:31:05,973 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1893] [2023-08-26 18:31:05,973 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1894] [2023-08-26 18:31:05,974 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1899] [2023-08-26 18:31:05,976 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1902] [2023-08-26 18:31:05,977 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1904] [2023-08-26 18:31:05,979 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1915] [2023-08-26 18:31:05,981 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1916] [2023-08-26 18:31:05,983 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1922] [2023-08-26 18:31:05,985 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1926] [2023-08-26 18:31:05,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:31:06,113 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:31:06,114 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:31:06,120 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:31:06,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06 WrapperNode [2023-08-26 18:31:06,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:31:06,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:31:06,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:31:06,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:31:06,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,250 INFO L138 Inliner]: procedures = 489, calls = 130, calls flagged for inlining = 48, calls inlined = 122, statements flattened = 1859 [2023-08-26 18:31:06,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:31:06,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:31:06,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:31:06,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:31:06,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:31:06,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:31:06,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:31:06,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:31:06,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (1/1) ... [2023-08-26 18:31:06,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:31:06,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:31:06,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:31:06,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:31:06,440 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2023-08-26 18:31:06,440 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2023-08-26 18:31:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:31:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:31:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:31:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:31:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 18:31:06,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:31:06,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-26 18:31:06,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:31:06,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:31:06,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:31:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-26 18:31:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:31:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:31:06,446 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:31:06,715 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:31:06,717 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:31:08,796 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:31:09,359 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:31:09,360 INFO L302 CfgBuilder]: Removed 11 assume(true) statements. [2023-08-26 18:31:09,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:31:09 BoogieIcfgContainer [2023-08-26 18:31:09,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:31:09,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:31:09,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:31:09,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:31:09,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:31:04" (1/3) ... [2023-08-26 18:31:09,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d173f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:31:09, skipping insertion in model container [2023-08-26 18:31:09,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:31:06" (2/3) ... [2023-08-26 18:31:09,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d173f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:31:09, skipping insertion in model container [2023-08-26 18:31:09,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:31:09" (3/3) ... [2023-08-26 18:31:09,371 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2023-08-26 18:31:09,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:31:09,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 519 error locations. [2023-08-26 18:31:09,389 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:31:09,583 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 18:31:09,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2054 places, 2126 transitions, 4260 flow [2023-08-26 18:31:10,949 INFO L124 PetriNetUnfolderBase]: 141/3968 cut-off events. [2023-08-26 18:31:10,949 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:31:11,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3974 conditions, 3968 events. 141/3968 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22403 event pairs, 0 based on Foata normal form. 0/2846 useless extension candidates. Maximal degree in co-relation 2032. Up to 6 conditions per place. [2023-08-26 18:31:11,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 2054 places, 2126 transitions, 4260 flow [2023-08-26 18:31:11,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2054 places, 2126 transitions, 4260 flow [2023-08-26 18:31:11,067 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:31:11,084 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 2054 places, 2126 transitions, 4260 flow [2023-08-26 18:31:11,090 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 2054 places, 2126 transitions, 4260 flow [2023-08-26 18:31:11,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2054 places, 2126 transitions, 4260 flow [2023-08-26 18:31:11,997 INFO L124 PetriNetUnfolderBase]: 141/3968 cut-off events. [2023-08-26 18:31:11,997 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:31:12,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3974 conditions, 3968 events. 141/3968 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22403 event pairs, 0 based on Foata normal form. 0/2846 useless extension candidates. Maximal degree in co-relation 2032. Up to 6 conditions per place. [2023-08-26 18:31:12,440 INFO L119 LiptonReduction]: Number of co-enabled transitions 683760 [2023-08-26 18:33:14,667 WARN L234 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 253 DAG size of output: 238 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 18:33:26,204 WARN L234 SmtUtils]: Spent 7.84s on a formula simplification. DAG size of input: 214 DAG size of output: 209 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 18:33:38,483 WARN L234 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 217 DAG size of output: 212 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 18:33:42,499 INFO L134 LiptonReduction]: Checked pairs total: 1720436 [2023-08-26 18:33:42,499 INFO L136 LiptonReduction]: Total number of compositions: 2648 [2023-08-26 18:33:42,511 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:33:42,514 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;@4bef030f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:33:42,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 563 error locations. [2023-08-26 18:33:42,516 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:33:42,516 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:33:42,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:33:42,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:33:42,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:33:42,517 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:33:42,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:33:42,521 INFO L85 PathProgramCache]: Analyzing trace with hash 8678, now seen corresponding path program 1 times [2023-08-26 18:33:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:33:42,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475401134] [2023-08-26 18:33:42,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:33:42,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:33:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:33:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:33:42,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:33:42,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475401134] [2023-08-26 18:33:42,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475401134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:33:42,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:33:42,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:33:42,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061170296] [2023-08-26 18:33:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:33:42,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:33:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:33:42,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:33:42,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:33:42,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1816 out of 4774 [2023-08-26 18:33:42,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 754 places, 782 transitions, 1572 flow. Second operand has 2 states, 2 states have (on average 1816.5) internal successors, (3633), 2 states have internal predecessors, (3633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:42,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:33:42,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1816 of 4774 [2023-08-26 18:33:42,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:33:47,715 INFO L124 PetriNetUnfolderBase]: 21558/44258 cut-off events. [2023-08-26 18:33:47,715 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:33:47,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86031 conditions, 44258 events. 21558/44258 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 386739 event pairs, 19264 based on Foata normal form. 90/19569 useless extension candidates. Maximal degree in co-relation 85023. Up to 41767 conditions per place. [2023-08-26 18:33:47,904 INFO L140 encePairwiseOnDemand]: 4571/4774 looper letters, 523 selfloop transitions, 0 changer transitions 0/579 dead transitions. [2023-08-26 18:33:47,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 579 transitions, 2212 flow [2023-08-26 18:33:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:33:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:33:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4358 transitions. [2023-08-26 18:33:47,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45643066610808547 [2023-08-26 18:33:47,933 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 4358 transitions. [2023-08-26 18:33:47,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 4358 transitions. [2023-08-26 18:33:47,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:33:47,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 4358 transitions. [2023-08-26 18:33:47,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 2179.0) internal successors, (4358), 2 states have internal predecessors, (4358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:47,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 4774.0) internal successors, (14322), 3 states have internal predecessors, (14322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:47,985 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 4774.0) internal successors, (14322), 3 states have internal predecessors, (14322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:47,987 INFO L175 Difference]: Start difference. First operand has 754 places, 782 transitions, 1572 flow. Second operand 2 states and 4358 transitions. [2023-08-26 18:33:47,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 579 transitions, 2212 flow [2023-08-26 18:33:47,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 579 transitions, 2212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:33:48,008 INFO L231 Difference]: Finished difference. Result has 557 places, 579 transitions, 1166 flow [2023-08-26 18:33:48,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1166, PETRI_PLACES=557, PETRI_TRANSITIONS=579} [2023-08-26 18:33:48,014 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -197 predicate places. [2023-08-26 18:33:48,014 INFO L495 AbstractCegarLoop]: Abstraction has has 557 places, 579 transitions, 1166 flow [2023-08-26 18:33:48,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1816.5) internal successors, (3633), 2 states have internal predecessors, (3633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:48,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:33:48,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 18:33:48,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:33:48,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:33:48,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:33:48,020 INFO L85 PathProgramCache]: Analyzing trace with hash 278431, now seen corresponding path program 1 times [2023-08-26 18:33:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:33:48,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283579484] [2023-08-26 18:33:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:33:48,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:33:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:33:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:33:48,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:33:48,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283579484] [2023-08-26 18:33:48,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283579484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:33:48,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:33:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:33:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667288511] [2023-08-26 18:33:48,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:33:48,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:33:48,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:33:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:33:48,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:33:48,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1514 out of 4774 [2023-08-26 18:33:48,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 579 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 1514.6666666666667) internal successors, (4544), 3 states have internal predecessors, (4544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:48,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:33:48,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1514 of 4774 [2023-08-26 18:33:48,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:33:53,283 INFO L124 PetriNetUnfolderBase]: 25391/50453 cut-off events. [2023-08-26 18:33:53,284 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:33:53,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99699 conditions, 50453 events. 25391/50453 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 433558 event pairs, 15299 based on Foata normal form. 0/22086 useless extension candidates. Maximal degree in co-relation 99695. Up to 48045 conditions per place. [2023-08-26 18:33:53,711 INFO L140 encePairwiseOnDemand]: 4762/4774 looper letters, 629 selfloop transitions, 10 changer transitions 0/665 dead transitions. [2023-08-26 18:33:53,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 665 transitions, 2616 flow [2023-08-26 18:33:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:33:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:33:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5183 transitions. [2023-08-26 18:33:53,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36189079737466834 [2023-08-26 18:33:53,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5183 transitions. [2023-08-26 18:33:53,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5183 transitions. [2023-08-26 18:33:53,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:33:53,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5183 transitions. [2023-08-26 18:33:53,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1727.6666666666667) internal successors, (5183), 3 states have internal predecessors, (5183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:53,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 4774.0) internal successors, (19096), 4 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:53,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 4774.0) internal successors, (19096), 4 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:53,772 INFO L175 Difference]: Start difference. First operand has 557 places, 579 transitions, 1166 flow. Second operand 3 states and 5183 transitions. [2023-08-26 18:33:53,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 665 transitions, 2616 flow [2023-08-26 18:33:53,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 665 transitions, 2616 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:33:53,784 INFO L231 Difference]: Finished difference. Result has 560 places, 587 transitions, 1242 flow [2023-08-26 18:33:53,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1242, PETRI_PLACES=560, PETRI_TRANSITIONS=587} [2023-08-26 18:33:53,786 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -194 predicate places. [2023-08-26 18:33:53,786 INFO L495 AbstractCegarLoop]: Abstraction has has 560 places, 587 transitions, 1242 flow [2023-08-26 18:33:53,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1514.6666666666667) internal successors, (4544), 3 states have internal predecessors, (4544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:53,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:33:53,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 18:33:53,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:33:53,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:33:53,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:33:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash 278430, now seen corresponding path program 1 times [2023-08-26 18:33:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:33:53,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339992455] [2023-08-26 18:33:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:33:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:33:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:33:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:33:54,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:33:54,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339992455] [2023-08-26 18:33:54,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339992455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:33:54,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:33:54,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:33:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648522304] [2023-08-26 18:33:54,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:33:54,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:33:54,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:33:54,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:33:54,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:33:54,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1511 out of 4774 [2023-08-26 18:33:54,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 587 transitions, 1242 flow. Second operand has 3 states, 3 states have (on average 1511.6666666666667) internal successors, (4535), 3 states have internal predecessors, (4535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:54,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:33:54,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1511 of 4774 [2023-08-26 18:33:54,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:33:59,123 INFO L124 PetriNetUnfolderBase]: 25391/50464 cut-off events. [2023-08-26 18:33:59,123 INFO L125 PetriNetUnfolderBase]: For 1904/1904 co-relation queries the response was YES. [2023-08-26 18:33:59,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102407 conditions, 50464 events. 25391/50464 cut-off events. For 1904/1904 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 433274 event pairs, 22176 based on Foata normal form. 0/22802 useless extension candidates. Maximal degree in co-relation 102401. Up to 49238 conditions per place. [2023-08-26 18:33:59,314 INFO L140 encePairwiseOnDemand]: 4770/4774 looper letters, 560 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2023-08-26 18:33:59,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 588 transitions, 2368 flow [2023-08-26 18:33:59,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:33:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:33:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5088 transitions. [2023-08-26 18:33:59,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3552576455802262 [2023-08-26 18:33:59,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5088 transitions. [2023-08-26 18:33:59,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5088 transitions. [2023-08-26 18:33:59,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:33:59,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5088 transitions. [2023-08-26 18:33:59,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1696.0) internal successors, (5088), 3 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:59,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 4774.0) internal successors, (19096), 4 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:59,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 4774.0) internal successors, (19096), 4 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:59,361 INFO L175 Difference]: Start difference. First operand has 560 places, 587 transitions, 1242 flow. Second operand 3 states and 5088 transitions. [2023-08-26 18:33:59,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 588 transitions, 2368 flow [2023-08-26 18:33:59,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 588 transitions, 2348 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:33:59,377 INFO L231 Difference]: Finished difference. Result has 561 places, 588 transitions, 1236 flow [2023-08-26 18:33:59,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=561, PETRI_TRANSITIONS=588} [2023-08-26 18:33:59,379 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -193 predicate places. [2023-08-26 18:33:59,379 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 588 transitions, 1236 flow [2023-08-26 18:33:59,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1511.6666666666667) internal successors, (4535), 3 states have internal predecessors, (4535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:33:59,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:33:59,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:33:59,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:33:59,381 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:33:59,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:33:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash 8654382, now seen corresponding path program 1 times [2023-08-26 18:33:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:33:59,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038270105] [2023-08-26 18:33:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:33:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:33:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:33:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:33:59,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:33:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038270105] [2023-08-26 18:33:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038270105] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:33:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966828196] [2023-08-26 18:33:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:33:59,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:33:59,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:33:59,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:33:59,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 18:33:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:33:59,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-26 18:33:59,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:33:59,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:33:59,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:33:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:33:59,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:33:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:33:59,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966828196] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:33:59,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:33:59,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2023-08-26 18:33:59,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236355029] [2023-08-26 18:33:59,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:33:59,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:33:59,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:33:59,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:33:59,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:33:59,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1511 out of 4774 [2023-08-26 18:34:00,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 588 transitions, 1236 flow. Second operand has 8 states, 8 states have (on average 1512.125) internal successors, (12097), 8 states have internal predecessors, (12097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:00,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:00,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1511 of 4774 [2023-08-26 18:34:00,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:06,357 INFO L124 PetriNetUnfolderBase]: 25396/50521 cut-off events. [2023-08-26 18:34:06,357 INFO L125 PetriNetUnfolderBase]: For 1493/1493 co-relation queries the response was YES. [2023-08-26 18:34:06,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102288 conditions, 50521 events. 25396/50521 cut-off events. For 1493/1493 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 434330 event pairs, 22133 based on Foata normal form. 0/22732 useless extension candidates. Maximal degree in co-relation 102281. Up to 49121 conditions per place. [2023-08-26 18:34:06,581 INFO L140 encePairwiseOnDemand]: 4766/4774 looper letters, 606 selfloop transitions, 12 changer transitions 0/644 dead transitions. [2023-08-26 18:34:06,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 644 transitions, 2604 flow [2023-08-26 18:34:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:34:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:34:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9678 transitions. [2023-08-26 18:34:06,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3378718056137411 [2023-08-26 18:34:06,605 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 9678 transitions. [2023-08-26 18:34:06,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 9678 transitions. [2023-08-26 18:34:06,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:06,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 9678 transitions. [2023-08-26 18:34:06,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1613.0) internal successors, (9678), 6 states have internal predecessors, (9678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:06,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 4774.0) internal successors, (33418), 7 states have internal predecessors, (33418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:06,669 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 4774.0) internal successors, (33418), 7 states have internal predecessors, (33418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:06,669 INFO L175 Difference]: Start difference. First operand has 561 places, 588 transitions, 1236 flow. Second operand 6 states and 9678 transitions. [2023-08-26 18:34:06,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 644 transitions, 2604 flow [2023-08-26 18:34:06,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 644 transitions, 2600 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:34:06,682 INFO L231 Difference]: Finished difference. Result has 568 places, 596 transitions, 1311 flow [2023-08-26 18:34:06,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1311, PETRI_PLACES=568, PETRI_TRANSITIONS=596} [2023-08-26 18:34:06,684 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -186 predicate places. [2023-08-26 18:34:06,684 INFO L495 AbstractCegarLoop]: Abstraction has has 568 places, 596 transitions, 1311 flow [2023-08-26 18:34:06,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1512.125) internal successors, (12097), 8 states have internal predecessors, (12097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:06,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:06,688 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2023-08-26 18:34:06,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 18:34:06,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:34:06,900 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:06,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash -272377577, now seen corresponding path program 1 times [2023-08-26 18:34:06,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:06,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602465091] [2023-08-26 18:34:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:06,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 18:34:07,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:07,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602465091] [2023-08-26 18:34:07,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602465091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:07,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:07,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:34:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830637248] [2023-08-26 18:34:07,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:07,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:34:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:07,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:34:07,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:34:07,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1519 out of 4774 [2023-08-26 18:34:07,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 596 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 1520.3333333333333) internal successors, (4561), 3 states have internal predecessors, (4561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:07,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:07,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1519 of 4774 [2023-08-26 18:34:07,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:12,478 INFO L124 PetriNetUnfolderBase]: 25433/50722 cut-off events. [2023-08-26 18:34:12,479 INFO L125 PetriNetUnfolderBase]: For 3469/3469 co-relation queries the response was YES. [2023-08-26 18:34:12,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104385 conditions, 50722 events. 25433/50722 cut-off events. For 3469/3469 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 437716 event pairs, 15490 based on Foata normal form. 0/22977 useless extension candidates. Maximal degree in co-relation 104375. Up to 48410 conditions per place. [2023-08-26 18:34:12,704 INFO L140 encePairwiseOnDemand]: 4762/4774 looper letters, 650 selfloop transitions, 12 changer transitions 1/689 dead transitions. [2023-08-26 18:34:12,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 689 transitions, 2870 flow [2023-08-26 18:34:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:34:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:34:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5199 transitions. [2023-08-26 18:34:12,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36300795978215333 [2023-08-26 18:34:12,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5199 transitions. [2023-08-26 18:34:12,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5199 transitions. [2023-08-26 18:34:12,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:12,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5199 transitions. [2023-08-26 18:34:12,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1733.0) internal successors, (5199), 3 states have internal predecessors, (5199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:12,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 4774.0) internal successors, (19096), 4 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:12,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 4774.0) internal successors, (19096), 4 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:12,744 INFO L175 Difference]: Start difference. First operand has 568 places, 596 transitions, 1311 flow. Second operand 3 states and 5199 transitions. [2023-08-26 18:34:12,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 689 transitions, 2870 flow [2023-08-26 18:34:12,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 689 transitions, 2854 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-26 18:34:12,759 INFO L231 Difference]: Finished difference. Result has 571 places, 605 transitions, 1399 flow [2023-08-26 18:34:12,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1399, PETRI_PLACES=571, PETRI_TRANSITIONS=605} [2023-08-26 18:34:12,760 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -183 predicate places. [2023-08-26 18:34:12,760 INFO L495 AbstractCegarLoop]: Abstraction has has 571 places, 605 transitions, 1399 flow [2023-08-26 18:34:12,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1520.3333333333333) internal successors, (4561), 3 states have internal predecessors, (4561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:12,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:12,762 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2023-08-26 18:34:12,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:34:12,762 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:12,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash -272377579, now seen corresponding path program 1 times [2023-08-26 18:34:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245446421] [2023-08-26 18:34:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:34:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245446421] [2023-08-26 18:34:12,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245446421] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:34:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953263735] [2023-08-26 18:34:12,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:34:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:34:12,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:34:12,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 18:34:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:13,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 18:34:13,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:34:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:34:13,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:34:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:34:13,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953263735] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:34:13,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:34:13,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-08-26 18:34:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725627059] [2023-08-26 18:34:13,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:34:13,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:34:13,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:13,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:34:13,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:34:13,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1776 out of 4774 [2023-08-26 18:34:13,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 605 transitions, 1399 flow. Second operand has 7 states, 7 states have (on average 1777.4285714285713) internal successors, (12442), 7 states have internal predecessors, (12442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:13,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:13,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1776 of 4774 [2023-08-26 18:34:13,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:13,500 INFO L124 PetriNetUnfolderBase]: 229/617 cut-off events. [2023-08-26 18:34:13,500 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-08-26 18:34:13,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 617 events. 229/617 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3545 event pairs, 3 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 1478. Up to 479 conditions per place. [2023-08-26 18:34:13,502 INFO L140 encePairwiseOnDemand]: 4768/4774 looper letters, 107 selfloop transitions, 8 changer transitions 1/124 dead transitions. [2023-08-26 18:34:13,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 124 transitions, 621 flow [2023-08-26 18:34:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:34:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:34:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10767 transitions. [2023-08-26 18:34:13,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3758902387934646 [2023-08-26 18:34:13,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 10767 transitions. [2023-08-26 18:34:13,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 10767 transitions. [2023-08-26 18:34:13,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:13,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 10767 transitions. [2023-08-26 18:34:13,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1794.5) internal successors, (10767), 6 states have internal predecessors, (10767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:13,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 4774.0) internal successors, (33418), 7 states have internal predecessors, (33418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:13,568 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 4774.0) internal successors, (33418), 7 states have internal predecessors, (33418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:13,568 INFO L175 Difference]: Start difference. First operand has 571 places, 605 transitions, 1399 flow. Second operand 6 states and 10767 transitions. [2023-08-26 18:34:13,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 124 transitions, 621 flow [2023-08-26 18:34:13,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 124 transitions, 567 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-26 18:34:13,572 INFO L231 Difference]: Finished difference. Result has 81 places, 73 transitions, 227 flow [2023-08-26 18:34:13,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2023-08-26 18:34:13,572 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -673 predicate places. [2023-08-26 18:34:13,573 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 227 flow [2023-08-26 18:34:13,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1777.4285714285713) internal successors, (12442), 7 states have internal predecessors, (12442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:13,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:13,574 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-26 18:34:13,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 18:34:13,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-26 18:34:13,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:13,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash 147547038, now seen corresponding path program 2 times [2023-08-26 18:34:13,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:13,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673458738] [2023-08-26 18:34:13,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:13,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:34:13,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:13,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673458738] [2023-08-26 18:34:13,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673458738] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:34:13,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928008993] [2023-08-26 18:34:13,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 18:34:13,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:34:13,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:34:13,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:34:13,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 18:34:14,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 18:34:14,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:34:14,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 18:34:14,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:34:14,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:34:14,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:34:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:34:14,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 18:34:14,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928008993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:14,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 18:34:14,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2023-08-26 18:34:14,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180562536] [2023-08-26 18:34:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:14,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:34:14,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:34:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-08-26 18:34:14,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1511 out of 4774 [2023-08-26 18:34:14,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 227 flow. Second operand has 7 states, 7 states have (on average 1511.857142857143) internal successors, (10583), 7 states have internal predecessors, (10583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:14,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:14,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1511 of 4774 [2023-08-26 18:34:14,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:14,594 INFO L124 PetriNetUnfolderBase]: 243/610 cut-off events. [2023-08-26 18:34:14,594 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2023-08-26 18:34:14,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 610 events. 243/610 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2876 event pairs, 215 based on Foata normal form. 2/379 useless extension candidates. Maximal degree in co-relation 1427. Up to 574 conditions per place. [2023-08-26 18:34:14,596 INFO L140 encePairwiseOnDemand]: 4768/4774 looper letters, 64 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2023-08-26 18:34:14,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 373 flow [2023-08-26 18:34:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:34:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:34:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10646 transitions. [2023-08-26 18:34:14,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3185708300915674 [2023-08-26 18:34:14,614 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 10646 transitions. [2023-08-26 18:34:14,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10646 transitions. [2023-08-26 18:34:14,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:14,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 10646 transitions. [2023-08-26 18:34:14,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 1520.857142857143) internal successors, (10646), 7 states have internal predecessors, (10646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:14,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 4774.0) internal successors, (38192), 8 states have internal predecessors, (38192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:14,657 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 4774.0) internal successors, (38192), 8 states have internal predecessors, (38192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:14,657 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 227 flow. Second operand 7 states and 10646 transitions. [2023-08-26 18:34:14,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 373 flow [2023-08-26 18:34:14,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 77 transitions, 346 flow, removed 2 selfloop flow, removed 9 redundant places. [2023-08-26 18:34:14,659 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 213 flow [2023-08-26 18:34:14,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2023-08-26 18:34:14,660 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -676 predicate places. [2023-08-26 18:34:14,660 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 213 flow [2023-08-26 18:34:14,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1511.857142857143) internal successors, (10583), 7 states have internal predecessors, (10583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:14,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:14,662 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 18:34:14,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 18:34:14,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:34:14,868 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:14,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:14,868 INFO L85 PathProgramCache]: Analyzing trace with hash 278972181, now seen corresponding path program 2 times [2023-08-26 18:34:14,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:14,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997594898] [2023-08-26 18:34:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:15,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:15,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997594898] [2023-08-26 18:34:15,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997594898] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:15,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:15,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:34:15,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898749994] [2023-08-26 18:34:15,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:15,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:34:15,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:15,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:34:15,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:34:15,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1512 out of 4774 [2023-08-26 18:34:15,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 1513.0) internal successors, (6052), 4 states have internal predecessors, (6052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:15,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:15,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1512 of 4774 [2023-08-26 18:34:15,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:15,236 INFO L124 PetriNetUnfolderBase]: 243/607 cut-off events. [2023-08-26 18:34:15,236 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-08-26 18:34:15,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 607 events. 243/607 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2852 event pairs, 88 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1422. Up to 574 conditions per place. [2023-08-26 18:34:15,238 INFO L140 encePairwiseOnDemand]: 4768/4774 looper letters, 66 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2023-08-26 18:34:15,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 367 flow [2023-08-26 18:34:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:34:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:34:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6113 transitions. [2023-08-26 18:34:15,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32011939673229994 [2023-08-26 18:34:15,249 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 6113 transitions. [2023-08-26 18:34:15,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 6113 transitions. [2023-08-26 18:34:15,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:15,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 6113 transitions. [2023-08-26 18:34:15,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 1528.25) internal successors, (6113), 4 states have internal predecessors, (6113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:15,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 4774.0) internal successors, (23870), 5 states have internal predecessors, (23870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:15,272 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 4774.0) internal successors, (23870), 5 states have internal predecessors, (23870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:15,272 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 213 flow. Second operand 4 states and 6113 transitions. [2023-08-26 18:34:15,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 367 flow [2023-08-26 18:34:15,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 355 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 18:34:15,274 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 220 flow [2023-08-26 18:34:15,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2023-08-26 18:34:15,277 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -677 predicate places. [2023-08-26 18:34:15,277 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 220 flow [2023-08-26 18:34:15,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1513.0) internal successors, (6052), 4 states have internal predecessors, (6052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:15,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:15,278 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:15,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:34:15,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:15,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:15,279 INFO L85 PathProgramCache]: Analyzing trace with hash 104619205, now seen corresponding path program 1 times [2023-08-26 18:34:15,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:15,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83440206] [2023-08-26 18:34:15,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:15,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:15,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:15,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83440206] [2023-08-26 18:34:15,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83440206] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:34:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834561945] [2023-08-26 18:34:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:15,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:34:15,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:34:15,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:34:15,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 18:34:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:15,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 18:34:15,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:34:15,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:34:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:15,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:34:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834561945] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:34:15,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:34:15,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-26 18:34:15,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768955253] [2023-08-26 18:34:15,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:34:15,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 18:34:15,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:15,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 18:34:15,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-08-26 18:34:15,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1512 out of 4774 [2023-08-26 18:34:15,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 220 flow. Second operand has 11 states, 11 states have (on average 1513.909090909091) internal successors, (16653), 11 states have internal predecessors, (16653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:15,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:15,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1512 of 4774 [2023-08-26 18:34:15,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:16,498 INFO L124 PetriNetUnfolderBase]: 245/721 cut-off events. [2023-08-26 18:34:16,498 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2023-08-26 18:34:16,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 721 events. 245/721 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4144 event pairs, 102 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 1721. Up to 490 conditions per place. [2023-08-26 18:34:16,501 INFO L140 encePairwiseOnDemand]: 4765/4774 looper letters, 110 selfloop transitions, 12 changer transitions 1/127 dead transitions. [2023-08-26 18:34:16,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 127 transitions, 598 flow [2023-08-26 18:34:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:34:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:34:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9187 transitions. [2023-08-26 18:34:16,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3207303449238933 [2023-08-26 18:34:16,515 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 9187 transitions. [2023-08-26 18:34:16,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 9187 transitions. [2023-08-26 18:34:16,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:16,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 9187 transitions. [2023-08-26 18:34:16,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1531.1666666666667) internal successors, (9187), 6 states have internal predecessors, (9187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:16,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 4774.0) internal successors, (33418), 7 states have internal predecessors, (33418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:16,554 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 4774.0) internal successors, (33418), 7 states have internal predecessors, (33418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:16,555 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 220 flow. Second operand 6 states and 9187 transitions. [2023-08-26 18:34:16,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 127 transitions, 598 flow [2023-08-26 18:34:16,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 127 transitions, 586 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:34:16,557 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 271 flow [2023-08-26 18:34:16,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2023-08-26 18:34:16,558 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -672 predicate places. [2023-08-26 18:34:16,558 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 271 flow [2023-08-26 18:34:16,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1513.909090909091) internal successors, (16653), 11 states have internal predecessors, (16653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:16,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:16,560 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:16,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 18:34:16,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:34:16,766 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:16,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1051589049, now seen corresponding path program 1 times [2023-08-26 18:34:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:16,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432487948] [2023-08-26 18:34:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:16,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:17,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:17,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432487948] [2023-08-26 18:34:17,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432487948] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:34:17,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354910601] [2023-08-26 18:34:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:17,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:34:17,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:34:17,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:34:17,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 18:34:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:17,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-26 18:34:17,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:34:17,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:34:17,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:34:17,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:34:17,394 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:34:17,402 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:34:17,402 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:34:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:17,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:34:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:19,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354910601] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:34:19,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:34:19,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-26 18:34:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143865082] [2023-08-26 18:34:19,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:34:19,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 18:34:19,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:19,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 18:34:19,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-08-26 18:34:19,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1345 out of 4774 [2023-08-26 18:34:19,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 271 flow. Second operand has 12 states, 12 states have (on average 1346.8333333333333) internal successors, (16162), 12 states have internal predecessors, (16162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:19,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:19,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1345 of 4774 [2023-08-26 18:34:19,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:20,525 INFO L124 PetriNetUnfolderBase]: 294/830 cut-off events. [2023-08-26 18:34:20,525 INFO L125 PetriNetUnfolderBase]: For 946/946 co-relation queries the response was YES. [2023-08-26 18:34:20,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 830 events. 294/830 cut-off events. For 946/946 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4367 event pairs, 61 based on Foata normal form. 17/557 useless extension candidates. Maximal degree in co-relation 2340. Up to 478 conditions per place. [2023-08-26 18:34:20,528 INFO L140 encePairwiseOnDemand]: 4762/4774 looper letters, 186 selfloop transitions, 25 changer transitions 1/213 dead transitions. [2023-08-26 18:34:20,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 213 transitions, 1051 flow [2023-08-26 18:34:20,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:34:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:34:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10961 transitions. [2023-08-26 18:34:20,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28699727691663174 [2023-08-26 18:34:20,537 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 10961 transitions. [2023-08-26 18:34:20,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10961 transitions. [2023-08-26 18:34:20,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:20,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 10961 transitions. [2023-08-26 18:34:20,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 1370.125) internal successors, (10961), 8 states have internal predecessors, (10961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:20,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 4774.0) internal successors, (42966), 9 states have internal predecessors, (42966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:20,581 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 4774.0) internal successors, (42966), 9 states have internal predecessors, (42966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:20,582 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 271 flow. Second operand 8 states and 10961 transitions. [2023-08-26 18:34:20,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 213 transitions, 1051 flow [2023-08-26 18:34:20,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 213 transitions, 1036 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 18:34:20,586 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 440 flow [2023-08-26 18:34:20,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=440, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2023-08-26 18:34:20,587 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -665 predicate places. [2023-08-26 18:34:20,587 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 440 flow [2023-08-26 18:34:20,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1346.8333333333333) internal successors, (16162), 12 states have internal predecessors, (16162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:20,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:20,589 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:20,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 18:34:20,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-26 18:34:20,795 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:20,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1760500597, now seen corresponding path program 1 times [2023-08-26 18:34:20,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:20,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22778230] [2023-08-26 18:34:20,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:20,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:20,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:20,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22778230] [2023-08-26 18:34:20,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22778230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:20,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:20,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:34:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896476914] [2023-08-26 18:34:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:20,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:34:20,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:34:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:34:20,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1810 out of 4774 [2023-08-26 18:34:20,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 93 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 1813.0) internal successors, (5439), 3 states have internal predecessors, (5439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:20,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:20,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1810 of 4774 [2023-08-26 18:34:20,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:21,170 INFO L124 PetriNetUnfolderBase]: 346/1056 cut-off events. [2023-08-26 18:34:21,170 INFO L125 PetriNetUnfolderBase]: For 2516/2516 co-relation queries the response was YES. [2023-08-26 18:34:21,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 1056 events. 346/1056 cut-off events. For 2516/2516 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6036 event pairs, 126 based on Foata normal form. 4/675 useless extension candidates. Maximal degree in co-relation 3159. Up to 522 conditions per place. [2023-08-26 18:34:21,174 INFO L140 encePairwiseOnDemand]: 4770/4774 looper letters, 126 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2023-08-26 18:34:21,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 138 transitions, 813 flow [2023-08-26 18:34:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:34:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:34:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5533 transitions. [2023-08-26 18:34:21,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38632872503840243 [2023-08-26 18:34:21,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5533 transitions. [2023-08-26 18:34:21,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5533 transitions. [2023-08-26 18:34:21,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:21,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5533 transitions. [2023-08-26 18:34:21,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1844.3333333333333) internal successors, (5533), 3 states have internal predecessors, (5533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:21,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 4774.0) internal successors, (19096), 4 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:21,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 4774.0) internal successors, (19096), 4 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:21,196 INFO L175 Difference]: Start difference. First operand has 89 places, 93 transitions, 440 flow. Second operand 3 states and 5533 transitions. [2023-08-26 18:34:21,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 138 transitions, 813 flow [2023-08-26 18:34:21,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 138 transitions, 791 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-26 18:34:21,201 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 415 flow [2023-08-26 18:34:21,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2023-08-26 18:34:21,201 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -664 predicate places. [2023-08-26 18:34:21,201 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 415 flow [2023-08-26 18:34:21,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1813.0) internal successors, (5439), 3 states have internal predecessors, (5439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:21,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:21,202 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:21,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:34:21,203 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting StealerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:21,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1248386969, now seen corresponding path program 1 times [2023-08-26 18:34:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:21,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814762882] [2023-08-26 18:34:21,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:21,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814762882] [2023-08-26 18:34:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814762882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:21,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:21,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:34:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916178176] [2023-08-26 18:34:21,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:21,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:34:21,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:21,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:34:21,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:34:21,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1511 out of 4774 [2023-08-26 18:34:21,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 1513.5) internal successors, (6054), 4 states have internal predecessors, (6054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:21,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:21,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1511 of 4774 [2023-08-26 18:34:21,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:21,581 INFO L124 PetriNetUnfolderBase]: 350/1022 cut-off events. [2023-08-26 18:34:21,581 INFO L125 PetriNetUnfolderBase]: For 2008/2008 co-relation queries the response was YES. [2023-08-26 18:34:21,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 1022 events. 350/1022 cut-off events. For 2008/2008 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5830 event pairs, 98 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 3058. Up to 635 conditions per place. [2023-08-26 18:34:21,584 INFO L140 encePairwiseOnDemand]: 4763/4774 looper letters, 74 selfloop transitions, 23 changer transitions 0/101 dead transitions. [2023-08-26 18:34:21,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 101 transitions, 698 flow [2023-08-26 18:34:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:34:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:34:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6110 transitions. [2023-08-26 18:34:21,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3199622957687474 [2023-08-26 18:34:21,589 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 6110 transitions. [2023-08-26 18:34:21,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 6110 transitions. [2023-08-26 18:34:21,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:21,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 6110 transitions. [2023-08-26 18:34:21,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 1527.5) internal successors, (6110), 4 states have internal predecessors, (6110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:21,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 4774.0) internal successors, (23870), 5 states have internal predecessors, (23870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:21,612 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 4774.0) internal successors, (23870), 5 states have internal predecessors, (23870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:21,612 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 415 flow. Second operand 4 states and 6110 transitions. [2023-08-26 18:34:21,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 101 transitions, 698 flow [2023-08-26 18:34:21,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 101 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:34:21,617 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 449 flow [2023-08-26 18:34:21,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2023-08-26 18:34:21,617 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -666 predicate places. [2023-08-26 18:34:21,618 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 449 flow [2023-08-26 18:34:21,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1513.5) internal successors, (6054), 4 states have internal predecessors, (6054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:21,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:21,619 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:21,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:34:21,619 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting StealerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:21,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1248386975, now seen corresponding path program 1 times [2023-08-26 18:34:21,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:21,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024589832] [2023-08-26 18:34:21,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:22,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:22,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024589832] [2023-08-26 18:34:22,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024589832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:22,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:22,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:34:22,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893992026] [2023-08-26 18:34:22,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:22,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:34:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:22,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:34:22,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:34:22,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1302 out of 4774 [2023-08-26 18:34:22,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 449 flow. Second operand has 8 states, 8 states have (on average 1303.25) internal successors, (10426), 8 states have internal predecessors, (10426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:22,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:22,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1302 of 4774 [2023-08-26 18:34:22,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:22,928 INFO L124 PetriNetUnfolderBase]: 370/1031 cut-off events. [2023-08-26 18:34:22,929 INFO L125 PetriNetUnfolderBase]: For 2244/2244 co-relation queries the response was YES. [2023-08-26 18:34:22,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 1031 events. 370/1031 cut-off events. For 2244/2244 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5604 event pairs, 65 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 3244. Up to 827 conditions per place. [2023-08-26 18:34:22,933 INFO L140 encePairwiseOnDemand]: 4762/4774 looper letters, 107 selfloop transitions, 17 changer transitions 0/125 dead transitions. [2023-08-26 18:34:22,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 125 transitions, 894 flow [2023-08-26 18:34:22,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:34:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:34:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11817 transitions. [2023-08-26 18:34:22,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27503142019271054 [2023-08-26 18:34:22,945 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 11817 transitions. [2023-08-26 18:34:22,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11817 transitions. [2023-08-26 18:34:22,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:22,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 11817 transitions. [2023-08-26 18:34:22,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 1313.0) internal successors, (11817), 9 states have internal predecessors, (11817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:22,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 4774.0) internal successors, (47740), 10 states have internal predecessors, (47740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:22,991 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 4774.0) internal successors, (47740), 10 states have internal predecessors, (47740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:22,992 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 449 flow. Second operand 9 states and 11817 transitions. [2023-08-26 18:34:22,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 125 transitions, 894 flow [2023-08-26 18:34:22,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 125 transitions, 834 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:34:22,996 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 519 flow [2023-08-26 18:34:22,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=519, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2023-08-26 18:34:22,997 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -655 predicate places. [2023-08-26 18:34:22,997 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 519 flow [2023-08-26 18:34:22,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1303.25) internal successors, (10426), 8 states have internal predecessors, (10426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:22,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:22,999 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:22,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:34:22,999 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting StealerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:22,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1248386971, now seen corresponding path program 1 times [2023-08-26 18:34:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290152484] [2023-08-26 18:34:22,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:23,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:23,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:23,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290152484] [2023-08-26 18:34:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290152484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:23,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:23,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:34:23,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953220004] [2023-08-26 18:34:23,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:23,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:34:23,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:23,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:34:23,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:34:23,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1538 out of 4774 [2023-08-26 18:34:23,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 519 flow. Second operand has 4 states, 4 states have (on average 1540.5) internal successors, (6162), 4 states have internal predecessors, (6162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:23,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:23,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1538 of 4774 [2023-08-26 18:34:23,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:23,421 INFO L124 PetriNetUnfolderBase]: 318/932 cut-off events. [2023-08-26 18:34:23,421 INFO L125 PetriNetUnfolderBase]: For 1924/1924 co-relation queries the response was YES. [2023-08-26 18:34:23,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2951 conditions, 932 events. 318/932 cut-off events. For 1924/1924 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5081 event pairs, 128 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 2929. Up to 613 conditions per place. [2023-08-26 18:34:23,424 INFO L140 encePairwiseOnDemand]: 4764/4774 looper letters, 70 selfloop transitions, 27 changer transitions 0/101 dead transitions. [2023-08-26 18:34:23,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 101 transitions, 766 flow [2023-08-26 18:34:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:34:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:34:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7755 transitions. [2023-08-26 18:34:23,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3248847926267281 [2023-08-26 18:34:23,432 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 7755 transitions. [2023-08-26 18:34:23,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 7755 transitions. [2023-08-26 18:34:23,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:23,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 7755 transitions. [2023-08-26 18:34:23,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1551.0) internal successors, (7755), 5 states have internal predecessors, (7755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:23,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 4774.0) internal successors, (28644), 6 states have internal predecessors, (28644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:23,460 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 4774.0) internal successors, (28644), 6 states have internal predecessors, (28644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:23,460 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 519 flow. Second operand 5 states and 7755 transitions. [2023-08-26 18:34:23,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 101 transitions, 766 flow [2023-08-26 18:34:23,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 101 transitions, 747 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 18:34:23,465 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 546 flow [2023-08-26 18:34:23,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=546, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2023-08-26 18:34:23,465 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -658 predicate places. [2023-08-26 18:34:23,465 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 546 flow [2023-08-26 18:34:23,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1540.5) internal successors, (6162), 4 states have internal predecessors, (6162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:23,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:23,466 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:23,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:34:23,467 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting StealerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:23,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash -567704566, now seen corresponding path program 1 times [2023-08-26 18:34:23,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:23,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161549392] [2023-08-26 18:34:23,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:23,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:23,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:23,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161549392] [2023-08-26 18:34:23,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161549392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:23,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:23,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:34:23,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067226208] [2023-08-26 18:34:23,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:23,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:34:23,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:23,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:34:23,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:34:23,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1427 out of 4774 [2023-08-26 18:34:23,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 546 flow. Second operand has 8 states, 8 states have (on average 1428.625) internal successors, (11429), 8 states have internal predecessors, (11429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:23,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:23,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1427 of 4774 [2023-08-26 18:34:23,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:24,635 INFO L124 PetriNetUnfolderBase]: 412/1161 cut-off events. [2023-08-26 18:34:24,635 INFO L125 PetriNetUnfolderBase]: For 2568/2568 co-relation queries the response was YES. [2023-08-26 18:34:24,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3755 conditions, 1161 events. 412/1161 cut-off events. For 2568/2568 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6710 event pairs, 14 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 3733. Up to 380 conditions per place. [2023-08-26 18:34:24,640 INFO L140 encePairwiseOnDemand]: 4761/4774 looper letters, 125 selfloop transitions, 35 changer transitions 0/163 dead transitions. [2023-08-26 18:34:24,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 163 transitions, 1344 flow [2023-08-26 18:34:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 18:34:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 18:34:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20085 transitions. [2023-08-26 18:34:24,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30051170028128554 [2023-08-26 18:34:24,659 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 20085 transitions. [2023-08-26 18:34:24,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20085 transitions. [2023-08-26 18:34:24,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:24,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 20085 transitions. [2023-08-26 18:34:24,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 1434.642857142857) internal successors, (20085), 14 states have internal predecessors, (20085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:24,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 4774.0) internal successors, (71610), 15 states have internal predecessors, (71610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:24,736 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 4774.0) internal successors, (71610), 15 states have internal predecessors, (71610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:24,736 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 546 flow. Second operand 14 states and 20085 transitions. [2023-08-26 18:34:24,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 163 transitions, 1344 flow [2023-08-26 18:34:24,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 163 transitions, 1303 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 18:34:24,742 INFO L231 Difference]: Finished difference. Result has 104 places, 97 transitions, 618 flow [2023-08-26 18:34:24,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=618, PETRI_PLACES=104, PETRI_TRANSITIONS=97} [2023-08-26 18:34:24,743 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -650 predicate places. [2023-08-26 18:34:24,743 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 97 transitions, 618 flow [2023-08-26 18:34:24,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1428.625) internal successors, (11429), 8 states have internal predecessors, (11429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:24,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:24,744 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:24,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:34:24,745 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:24,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash -567704569, now seen corresponding path program 1 times [2023-08-26 18:34:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:24,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632209873] [2023-08-26 18:34:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:25,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:25,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632209873] [2023-08-26 18:34:25,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632209873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:25,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:25,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:34:25,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774808745] [2023-08-26 18:34:25,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:25,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:34:25,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:25,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:34:25,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:34:25,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1300 out of 4774 [2023-08-26 18:34:25,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 97 transitions, 618 flow. Second operand has 8 states, 8 states have (on average 1301.625) internal successors, (10413), 8 states have internal predecessors, (10413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:25,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:25,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1300 of 4774 [2023-08-26 18:34:25,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:25,797 INFO L124 PetriNetUnfolderBase]: 453/1244 cut-off events. [2023-08-26 18:34:25,797 INFO L125 PetriNetUnfolderBase]: For 2796/2796 co-relation queries the response was YES. [2023-08-26 18:34:25,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4227 conditions, 1244 events. 453/1244 cut-off events. For 2796/2796 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7211 event pairs, 105 based on Foata normal form. 13/961 useless extension candidates. Maximal degree in co-relation 4206. Up to 580 conditions per place. [2023-08-26 18:34:25,802 INFO L140 encePairwiseOnDemand]: 4762/4774 looper letters, 124 selfloop transitions, 39 changer transitions 0/164 dead transitions. [2023-08-26 18:34:25,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 164 transitions, 1372 flow [2023-08-26 18:34:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:34:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:34:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15707 transitions. [2023-08-26 18:34:25,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27417609272447985 [2023-08-26 18:34:25,816 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 15707 transitions. [2023-08-26 18:34:25,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15707 transitions. [2023-08-26 18:34:25,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:25,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 15707 transitions. [2023-08-26 18:34:25,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 1308.9166666666667) internal successors, (15707), 12 states have internal predecessors, (15707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:25,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 4774.0) internal successors, (62062), 13 states have internal predecessors, (62062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:25,880 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 4774.0) internal successors, (62062), 13 states have internal predecessors, (62062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:25,880 INFO L175 Difference]: Start difference. First operand has 104 places, 97 transitions, 618 flow. Second operand 12 states and 15707 transitions. [2023-08-26 18:34:25,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 164 transitions, 1372 flow [2023-08-26 18:34:25,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 164 transitions, 1264 flow, removed 2 selfloop flow, removed 11 redundant places. [2023-08-26 18:34:25,887 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 633 flow [2023-08-26 18:34:25,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=633, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2023-08-26 18:34:25,887 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -650 predicate places. [2023-08-26 18:34:25,887 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 633 flow [2023-08-26 18:34:25,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1301.625) internal successors, (10413), 8 states have internal predecessors, (10413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:25,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:25,889 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:25,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:34:25,889 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:25,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2078270262, now seen corresponding path program 1 times [2023-08-26 18:34:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392231728] [2023-08-26 18:34:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-26 18:34:26,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:26,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392231728] [2023-08-26 18:34:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392231728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:26,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:26,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:34:26,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416247349] [2023-08-26 18:34:26,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:26,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:34:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:26,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:34:26,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:34:26,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1506 out of 4774 [2023-08-26 18:34:26,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 633 flow. Second operand has 5 states, 5 states have (on average 1508.8) internal successors, (7544), 5 states have internal predecessors, (7544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:26,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:26,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1506 of 4774 [2023-08-26 18:34:26,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:26,481 INFO L124 PetriNetUnfolderBase]: 325/1018 cut-off events. [2023-08-26 18:34:26,481 INFO L125 PetriNetUnfolderBase]: For 2536/2536 co-relation queries the response was YES. [2023-08-26 18:34:26,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 1018 events. 325/1018 cut-off events. For 2536/2536 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5939 event pairs, 106 based on Foata normal form. 90/891 useless extension candidates. Maximal degree in co-relation 3464. Up to 662 conditions per place. [2023-08-26 18:34:26,484 INFO L140 encePairwiseOnDemand]: 4765/4774 looper letters, 67 selfloop transitions, 37 changer transitions 1/109 dead transitions. [2023-08-26 18:34:26,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 109 transitions, 911 flow [2023-08-26 18:34:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:34:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:34:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7586 transitions. [2023-08-26 18:34:26,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.317804775869292 [2023-08-26 18:34:26,490 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 7586 transitions. [2023-08-26 18:34:26,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 7586 transitions. [2023-08-26 18:34:26,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:26,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 7586 transitions. [2023-08-26 18:34:26,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1517.2) internal successors, (7586), 5 states have internal predecessors, (7586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:26,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 4774.0) internal successors, (28644), 6 states have internal predecessors, (28644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:26,514 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 4774.0) internal successors, (28644), 6 states have internal predecessors, (28644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:26,515 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 633 flow. Second operand 5 states and 7586 transitions. [2023-08-26 18:34:26,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 109 transitions, 911 flow [2023-08-26 18:34:26,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 109 transitions, 872 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 18:34:26,521 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 664 flow [2023-08-26 18:34:26,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=664, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2023-08-26 18:34:26,521 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -651 predicate places. [2023-08-26 18:34:26,522 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 664 flow [2023-08-26 18:34:26,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1508.8) internal successors, (7544), 5 states have internal predecessors, (7544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:26,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:26,523 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:26,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:34:26,523 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:26,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1790739455, now seen corresponding path program 1 times [2023-08-26 18:34:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:26,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824142023] [2023-08-26 18:34:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:27,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:27,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824142023] [2023-08-26 18:34:27,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824142023] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:34:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815588783] [2023-08-26 18:34:27,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:27,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:34:27,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:34:27,117 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:34:27,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 18:34:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:27,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-26 18:34:27,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:34:27,384 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:34:27,391 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:34:27,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:34:27,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:34:27,467 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 18:34:27,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 18:34:27,519 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 18:34:27,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 18:34:27,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:34:27,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:34:27,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:34:27,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:34:27,642 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:34:27,642 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:34:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:27,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:34:30,656 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (forall ((v_ArrVal_1625 Int) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_178| Int)) (or (not (= (select (store |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_1625) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_178|) 0)) (forall ((v_ArrVal_1626 Int)) (<= (+ .cse0 |c_ULTIMATE.start_main_~#handles~0#1.offset| 4) (select (store |c_#length| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_178| v_ArrVal_1626) |c_ULTIMATE.start_main_~#handles~0#1.base|))))) (or (forall ((v_ArrVal_1625 Int) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_178| Int)) (not (= (select (store |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_1625) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_178|) 0))) (<= 0 (+ .cse0 |c_ULTIMATE.start_main_~#handles~0#1.offset|))))) is different from false [2023-08-26 18:34:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:35,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815588783] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:34:35,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:34:35,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 15 [2023-08-26 18:34:35,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610972783] [2023-08-26 18:34:35,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:34:35,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 18:34:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:35,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 18:34:35,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=165, Unknown=1, NotChecked=28, Total=272 [2023-08-26 18:34:35,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1333 out of 4774 [2023-08-26 18:34:35,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 664 flow. Second operand has 17 states, 17 states have (on average 1335.5294117647059) internal successors, (22704), 17 states have internal predecessors, (22704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:35,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:35,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1333 of 4774 [2023-08-26 18:34:35,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:44,355 WARN L234 SmtUtils]: Spent 7.94s on a formula simplification. DAG size of input: 37 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 18:34:44,701 INFO L124 PetriNetUnfolderBase]: 504/1709 cut-off events. [2023-08-26 18:34:44,701 INFO L125 PetriNetUnfolderBase]: For 5135/5135 co-relation queries the response was YES. [2023-08-26 18:34:44,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5884 conditions, 1709 events. 504/1709 cut-off events. For 5135/5135 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 12524 event pairs, 116 based on Foata normal form. 138/1399 useless extension candidates. Maximal degree in co-relation 5862. Up to 510 conditions per place. [2023-08-26 18:34:44,709 INFO L140 encePairwiseOnDemand]: 4757/4774 looper letters, 228 selfloop transitions, 78 changer transitions 4/311 dead transitions. [2023-08-26 18:34:44,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 311 transitions, 2252 flow [2023-08-26 18:34:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 18:34:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 18:34:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17565 transitions. [2023-08-26 18:34:44,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2830234281847185 [2023-08-26 18:34:44,720 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 17565 transitions. [2023-08-26 18:34:44,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17565 transitions. [2023-08-26 18:34:44,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:44,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 17565 transitions. [2023-08-26 18:34:44,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 1351.1538461538462) internal successors, (17565), 13 states have internal predecessors, (17565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:44,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 4774.0) internal successors, (66836), 14 states have internal predecessors, (66836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:44,771 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 4774.0) internal successors, (66836), 14 states have internal predecessors, (66836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:44,771 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 664 flow. Second operand 13 states and 17565 transitions. [2023-08-26 18:34:44,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 311 transitions, 2252 flow [2023-08-26 18:34:44,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 311 transitions, 2094 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:34:44,786 INFO L231 Difference]: Finished difference. Result has 117 places, 145 transitions, 1261 flow [2023-08-26 18:34:44,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1261, PETRI_PLACES=117, PETRI_TRANSITIONS=145} [2023-08-26 18:34:44,786 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -637 predicate places. [2023-08-26 18:34:44,787 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 145 transitions, 1261 flow [2023-08-26 18:34:44,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1335.5294117647059) internal successors, (22704), 17 states have internal predecessors, (22704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:44,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:44,789 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:44,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 18:34:44,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 18:34:44,996 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting StealerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:44,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:44,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1115717883, now seen corresponding path program 1 times [2023-08-26 18:34:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:44,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263995999] [2023-08-26 18:34:44,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:44,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:45,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:45,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263995999] [2023-08-26 18:34:45,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263995999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:45,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:45,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:34:45,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945249515] [2023-08-26 18:34:45,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:45,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:34:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:45,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:34:45,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:34:45,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1398 out of 4774 [2023-08-26 18:34:45,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 145 transitions, 1261 flow. Second operand has 6 states, 6 states have (on average 1400.6666666666667) internal successors, (8404), 6 states have internal predecessors, (8404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:45,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:45,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1398 of 4774 [2023-08-26 18:34:45,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:45,981 INFO L124 PetriNetUnfolderBase]: 466/1586 cut-off events. [2023-08-26 18:34:45,981 INFO L125 PetriNetUnfolderBase]: For 9028/9028 co-relation queries the response was YES. [2023-08-26 18:34:45,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 1586 events. 466/1586 cut-off events. For 9028/9028 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 11328 event pairs, 233 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 6371. Up to 1215 conditions per place. [2023-08-26 18:34:45,989 INFO L140 encePairwiseOnDemand]: 4766/4774 looper letters, 111 selfloop transitions, 53 changer transitions 0/167 dead transitions. [2023-08-26 18:34:45,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 167 transitions, 1847 flow [2023-08-26 18:34:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:34:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:34:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11254 transitions. [2023-08-26 18:34:45,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29466904063678256 [2023-08-26 18:34:45,997 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 11254 transitions. [2023-08-26 18:34:45,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11254 transitions. [2023-08-26 18:34:45,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:45,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 11254 transitions. [2023-08-26 18:34:46,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 1406.75) internal successors, (11254), 8 states have internal predecessors, (11254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:46,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 4774.0) internal successors, (42966), 9 states have internal predecessors, (42966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:46,029 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 4774.0) internal successors, (42966), 9 states have internal predecessors, (42966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:46,029 INFO L175 Difference]: Start difference. First operand has 117 places, 145 transitions, 1261 flow. Second operand 8 states and 11254 transitions. [2023-08-26 18:34:46,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 167 transitions, 1847 flow [2023-08-26 18:34:46,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 167 transitions, 1791 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-26 18:34:46,044 INFO L231 Difference]: Finished difference. Result has 120 places, 145 transitions, 1317 flow [2023-08-26 18:34:46,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1317, PETRI_PLACES=120, PETRI_TRANSITIONS=145} [2023-08-26 18:34:46,045 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -634 predicate places. [2023-08-26 18:34:46,045 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 145 transitions, 1317 flow [2023-08-26 18:34:46,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1400.6666666666667) internal successors, (8404), 6 states have internal predecessors, (8404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:46,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:46,046 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:46,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:34:46,046 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting StealerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:46,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:46,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1115717888, now seen corresponding path program 1 times [2023-08-26 18:34:46,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:46,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591439285] [2023-08-26 18:34:46,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:46,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:47,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:47,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591439285] [2023-08-26 18:34:47,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591439285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:47,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:47,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-26 18:34:47,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160888397] [2023-08-26 18:34:47,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:47,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 18:34:47,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:47,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 18:34:47,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-08-26 18:34:47,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1296 out of 4774 [2023-08-26 18:34:47,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 145 transitions, 1317 flow. Second operand has 13 states, 13 states have (on average 1297.2307692307693) internal successors, (16864), 13 states have internal predecessors, (16864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:47,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:47,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1296 of 4774 [2023-08-26 18:34:47,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:48,467 INFO L124 PetriNetUnfolderBase]: 468/1520 cut-off events. [2023-08-26 18:34:48,467 INFO L125 PetriNetUnfolderBase]: For 9220/9220 co-relation queries the response was YES. [2023-08-26 18:34:48,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6433 conditions, 1520 events. 468/1520 cut-off events. For 9220/9220 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 10550 event pairs, 250 based on Foata normal form. 0/1152 useless extension candidates. Maximal degree in co-relation 6406. Up to 1092 conditions per place. [2023-08-26 18:34:48,475 INFO L140 encePairwiseOnDemand]: 4760/4774 looper letters, 90 selfloop transitions, 79 changer transitions 0/170 dead transitions. [2023-08-26 18:34:48,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 170 transitions, 1978 flow [2023-08-26 18:34:48,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:34:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:34:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15627 transitions. [2023-08-26 18:34:48,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2727796397151236 [2023-08-26 18:34:48,485 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 15627 transitions. [2023-08-26 18:34:48,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15627 transitions. [2023-08-26 18:34:48,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:48,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 15627 transitions. [2023-08-26 18:34:48,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 1302.25) internal successors, (15627), 12 states have internal predecessors, (15627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:48,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 4774.0) internal successors, (62062), 13 states have internal predecessors, (62062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:48,531 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 4774.0) internal successors, (62062), 13 states have internal predecessors, (62062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:48,532 INFO L175 Difference]: Start difference. First operand has 120 places, 145 transitions, 1317 flow. Second operand 12 states and 15627 transitions. [2023-08-26 18:34:48,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 170 transitions, 1978 flow [2023-08-26 18:34:48,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 170 transitions, 1917 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-26 18:34:48,545 INFO L231 Difference]: Finished difference. Result has 123 places, 142 transitions, 1408 flow [2023-08-26 18:34:48,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1408, PETRI_PLACES=123, PETRI_TRANSITIONS=142} [2023-08-26 18:34:48,545 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -631 predicate places. [2023-08-26 18:34:48,545 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 142 transitions, 1408 flow [2023-08-26 18:34:48,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1297.2307692307693) internal successors, (16864), 13 states have internal predecessors, (16864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:48,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:48,547 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:48,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:34:48,548 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting StealerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:48,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash -382442807, now seen corresponding path program 1 times [2023-08-26 18:34:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581053408] [2023-08-26 18:34:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:48,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:48,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581053408] [2023-08-26 18:34:48,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581053408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:34:48,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:34:48,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:34:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628426535] [2023-08-26 18:34:48,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:34:48,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:34:48,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:48,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:34:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:34:48,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1392 out of 4774 [2023-08-26 18:34:48,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 142 transitions, 1408 flow. Second operand has 8 states, 8 states have (on average 1394.375) internal successors, (11155), 8 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:48,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:48,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1392 of 4774 [2023-08-26 18:34:48,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:49,586 INFO L124 PetriNetUnfolderBase]: 406/1363 cut-off events. [2023-08-26 18:34:49,586 INFO L125 PetriNetUnfolderBase]: For 8120/8120 co-relation queries the response was YES. [2023-08-26 18:34:49,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5767 conditions, 1363 events. 406/1363 cut-off events. For 8120/8120 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 9293 event pairs, 180 based on Foata normal form. 22/1147 useless extension candidates. Maximal degree in co-relation 5740. Up to 932 conditions per place. [2023-08-26 18:34:49,593 INFO L140 encePairwiseOnDemand]: 4760/4774 looper letters, 71 selfloop transitions, 81 changer transitions 2/157 dead transitions. [2023-08-26 18:34:49,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 157 transitions, 1918 flow [2023-08-26 18:34:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:34:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:34:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13987 transitions. [2023-08-26 18:34:49,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29298282362798495 [2023-08-26 18:34:49,605 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 13987 transitions. [2023-08-26 18:34:49,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13987 transitions. [2023-08-26 18:34:49,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:49,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 13987 transitions. [2023-08-26 18:34:49,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 1398.7) internal successors, (13987), 10 states have internal predecessors, (13987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:49,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 4774.0) internal successors, (52514), 11 states have internal predecessors, (52514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:49,650 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 4774.0) internal successors, (52514), 11 states have internal predecessors, (52514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:49,650 INFO L175 Difference]: Start difference. First operand has 123 places, 142 transitions, 1408 flow. Second operand 10 states and 13987 transitions. [2023-08-26 18:34:49,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 157 transitions, 1918 flow [2023-08-26 18:34:49,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 157 transitions, 1736 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-08-26 18:34:49,663 INFO L231 Difference]: Finished difference. Result has 117 places, 137 transitions, 1371 flow [2023-08-26 18:34:49,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1371, PETRI_PLACES=117, PETRI_TRANSITIONS=137} [2023-08-26 18:34:49,664 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -637 predicate places. [2023-08-26 18:34:49,664 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 137 transitions, 1371 flow [2023-08-26 18:34:49,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1394.375) internal successors, (11155), 8 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:49,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:49,666 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:49,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 18:34:49,666 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:49,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1029169314, now seen corresponding path program 1 times [2023-08-26 18:34:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:49,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775560388] [2023-08-26 18:34:49,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:50,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:34:50,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775560388] [2023-08-26 18:34:50,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775560388] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:34:50,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536555324] [2023-08-26 18:34:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:50,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:34:50,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:34:50,342 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:34:50,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 18:34:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:34:50,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-26 18:34:50,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:34:50,640 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:34:50,645 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:34:50,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:34:50,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:34:50,745 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 18:34:50,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 18:34:50,777 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 18:34:50,778 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 18:34:50,787 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:34:50,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:34:50,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:34:50,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:34:50,897 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:34:50,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:34:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:50,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:34:54,069 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (forall ((|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_182| Int) (v_ArrVal_2167 Int)) (or (forall ((v_ArrVal_2168 Int)) (<= (+ .cse0 |c_ULTIMATE.start_main_~#handles~0#1.offset| 8) (select (store |c_#length| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_182| v_ArrVal_2168) |c_ULTIMATE.start_main_~#handles~0#1.base|))) (not (= (select (store |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_2167) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_182|) 0)))) (or (<= 0 (+ .cse0 |c_ULTIMATE.start_main_~#handles~0#1.offset| 4)) (forall ((|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_182| Int) (v_ArrVal_2167 Int)) (not (= (select (store |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_2167) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_182|) 0)))))) is different from false [2023-08-26 18:34:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:34:54,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536555324] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:34:54,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:34:54,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 19 [2023-08-26 18:34:54,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040880763] [2023-08-26 18:34:54,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:34:54,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-26 18:34:54,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:34:54,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-26 18:34:54,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=265, Unknown=1, NotChecked=36, Total=420 [2023-08-26 18:34:54,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1333 out of 4774 [2023-08-26 18:34:54,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 137 transitions, 1371 flow. Second operand has 21 states, 21 states have (on average 1335.857142857143) internal successors, (28053), 21 states have internal predecessors, (28053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:54,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:34:54,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1333 of 4774 [2023-08-26 18:34:54,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:34:57,859 INFO L124 PetriNetUnfolderBase]: 544/2014 cut-off events. [2023-08-26 18:34:57,859 INFO L125 PetriNetUnfolderBase]: For 12516/12516 co-relation queries the response was YES. [2023-08-26 18:34:57,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8200 conditions, 2014 events. 544/2014 cut-off events. For 12516/12516 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 16406 event pairs, 58 based on Foata normal form. 111/1725 useless extension candidates. Maximal degree in co-relation 8173. Up to 535 conditions per place. [2023-08-26 18:34:57,868 INFO L140 encePairwiseOnDemand]: 4758/4774 looper letters, 237 selfloop transitions, 98 changer transitions 10/346 dead transitions. [2023-08-26 18:34:57,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 346 transitions, 3451 flow [2023-08-26 18:34:57,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:34:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:34:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16177 transitions. [2023-08-26 18:34:57,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28238025415444773 [2023-08-26 18:34:57,879 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 16177 transitions. [2023-08-26 18:34:57,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16177 transitions. [2023-08-26 18:34:57,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:34:57,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 16177 transitions. [2023-08-26 18:34:57,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 1348.0833333333333) internal successors, (16177), 12 states have internal predecessors, (16177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:57,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 4774.0) internal successors, (62062), 13 states have internal predecessors, (62062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:57,923 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 4774.0) internal successors, (62062), 13 states have internal predecessors, (62062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:57,923 INFO L175 Difference]: Start difference. First operand has 117 places, 137 transitions, 1371 flow. Second operand 12 states and 16177 transitions. [2023-08-26 18:34:57,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 346 transitions, 3451 flow [2023-08-26 18:34:57,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 346 transitions, 3330 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-08-26 18:34:57,949 INFO L231 Difference]: Finished difference. Result has 128 places, 195 transitions, 2392 flow [2023-08-26 18:34:57,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2392, PETRI_PLACES=128, PETRI_TRANSITIONS=195} [2023-08-26 18:34:57,949 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -626 predicate places. [2023-08-26 18:34:57,949 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 195 transitions, 2392 flow [2023-08-26 18:34:57,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1335.857142857143) internal successors, (28053), 21 states have internal predecessors, (28053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:34:57,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:34:57,952 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:34:57,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 18:34:58,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:34:58,153 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting StealerErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:34:58,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:34:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1029192773, now seen corresponding path program 1 times [2023-08-26 18:34:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:34:58,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756074934] [2023-08-26 18:34:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:34:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:34:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:35:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:35:00,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:35:00,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756074934] [2023-08-26 18:35:00,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756074934] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:35:00,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489346337] [2023-08-26 18:35:00,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:35:00,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:35:00,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:35:00,277 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:35:00,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 18:35:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:35:00,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 146 conjunts are in the unsatisfiable core [2023-08-26 18:35:00,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:35:00,641 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:35:00,642 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:35:00,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-08-26 18:35:00,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:00,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:00,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:00,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:35:00,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:00,820 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:01,196 INFO L322 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2023-08-26 18:35:01,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 170 [2023-08-26 18:35:01,206 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:01,208 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2023-08-26 18:35:01,224 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:01,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-08-26 18:35:01,238 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 18:35:01,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 18:35:01,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2023-08-26 18:35:01,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 86 [2023-08-26 18:35:01,719 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 80 [2023-08-26 18:35:01,755 INFO L322 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2023-08-26 18:35:01,756 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 121 [2023-08-26 18:35:01,767 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-26 18:35:01,768 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2023-08-26 18:35:01,772 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:01,773 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2023-08-26 18:35:01,777 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:01,777 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-08-26 18:35:01,783 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 18:35:01,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 163 [2023-08-26 18:35:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:35:02,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:35:02,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 200 [2023-08-26 18:35:02,198 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 212 [2023-08-26 18:35:02,473 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:02,473 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 112 [2023-08-26 18:35:02,488 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:02,489 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2023-08-26 18:35:02,522 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:02,523 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:35:02,578 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:02,578 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:35:04,123 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:04,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 170 [2023-08-26 18:35:04,144 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 18:35:04,144 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 135 [2023-08-26 18:35:04,162 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:04,163 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 136 [2023-08-26 18:35:04,187 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:04,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 148 [2023-08-26 18:35:04,497 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:04,498 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:35:04,505 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:04,506 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:35:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 3 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 18:35:15,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489346337] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:35:15,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:35:15,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 43 [2023-08-26 18:35:15,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128638353] [2023-08-26 18:35:15,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:35:15,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-26 18:35:15,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:35:15,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-26 18:35:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1793, Unknown=9, NotChecked=0, Total=1980 [2023-08-26 18:35:15,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1246 out of 4774 [2023-08-26 18:35:15,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 195 transitions, 2392 flow. Second operand has 45 states, 45 states have (on average 1247.4222222222222) internal successors, (56134), 45 states have internal predecessors, (56134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:15,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:35:15,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1246 of 4774 [2023-08-26 18:35:15,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:35:41,453 INFO L124 PetriNetUnfolderBase]: 470/1799 cut-off events. [2023-08-26 18:35:41,453 INFO L125 PetriNetUnfolderBase]: For 14983/14983 co-relation queries the response was YES. [2023-08-26 18:35:41,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8461 conditions, 1799 events. 470/1799 cut-off events. For 14983/14983 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 13972 event pairs, 135 based on Foata normal form. 12/1458 useless extension candidates. Maximal degree in co-relation 8428. Up to 1290 conditions per place. [2023-08-26 18:35:41,463 INFO L140 encePairwiseOnDemand]: 4753/4774 looper letters, 228 selfloop transitions, 64 changer transitions 13/306 dead transitions. [2023-08-26 18:35:41,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 306 transitions, 4168 flow [2023-08-26 18:35:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-26 18:35:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-26 18:35:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33784 transitions. [2023-08-26 18:35:41,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2620987137116169 [2023-08-26 18:35:41,491 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 33784 transitions. [2023-08-26 18:35:41,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33784 transitions. [2023-08-26 18:35:41,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:35:41,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 33784 transitions. [2023-08-26 18:35:41,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 1251.2592592592594) internal successors, (33784), 27 states have internal predecessors, (33784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:41,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 4774.0) internal successors, (133672), 28 states have internal predecessors, (133672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:41,608 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 4774.0) internal successors, (133672), 28 states have internal predecessors, (133672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:41,608 INFO L175 Difference]: Start difference. First operand has 128 places, 195 transitions, 2392 flow. Second operand 27 states and 33784 transitions. [2023-08-26 18:35:41,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 306 transitions, 4168 flow [2023-08-26 18:35:41,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 306 transitions, 4097 flow, removed 32 selfloop flow, removed 2 redundant places. [2023-08-26 18:35:41,635 INFO L231 Difference]: Finished difference. Result has 165 places, 232 transitions, 3060 flow [2023-08-26 18:35:41,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3060, PETRI_PLACES=165, PETRI_TRANSITIONS=232} [2023-08-26 18:35:41,635 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -589 predicate places. [2023-08-26 18:35:41,636 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 232 transitions, 3060 flow [2023-08-26 18:35:41,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1247.4222222222222) internal successors, (56134), 45 states have internal predecessors, (56134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:41,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:35:41,641 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:35:41,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 18:35:41,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-26 18:35:41,842 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:35:41,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:35:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1840117953, now seen corresponding path program 1 times [2023-08-26 18:35:41,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:35:41,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835832665] [2023-08-26 18:35:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:35:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:35:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:35:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:35:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:35:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835832665] [2023-08-26 18:35:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835832665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:35:42,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:35:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:35:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098729188] [2023-08-26 18:35:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:35:42,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:35:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:35:42,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:35:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:35:42,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1811 out of 4774 [2023-08-26 18:35:42,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 232 transitions, 3060 flow. Second operand has 3 states, 3 states have (on average 1818.0) internal successors, (5454), 3 states have internal predecessors, (5454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:42,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:35:42,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1811 of 4774 [2023-08-26 18:35:42,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:35:42,469 INFO L124 PetriNetUnfolderBase]: 308/1279 cut-off events. [2023-08-26 18:35:42,470 INFO L125 PetriNetUnfolderBase]: For 12155/12158 co-relation queries the response was YES. [2023-08-26 18:35:42,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6785 conditions, 1279 events. 308/1279 cut-off events. For 12155/12158 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8918 event pairs, 136 based on Foata normal form. 31/1170 useless extension candidates. Maximal degree in co-relation 6739. Up to 1044 conditions per place. [2023-08-26 18:35:42,476 INFO L140 encePairwiseOnDemand]: 4769/4774 looper letters, 230 selfloop transitions, 3 changer transitions 0/241 dead transitions. [2023-08-26 18:35:42,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 241 transitions, 3683 flow [2023-08-26 18:35:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:35:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:35:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5476 transitions. [2023-08-26 18:35:42,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3823488339617372 [2023-08-26 18:35:42,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5476 transitions. [2023-08-26 18:35:42,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5476 transitions. [2023-08-26 18:35:42,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:35:42,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5476 transitions. [2023-08-26 18:35:42,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1825.3333333333333) internal successors, (5476), 3 states have internal predecessors, (5476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:42,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 4774.0) internal successors, (19096), 4 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:42,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 4774.0) internal successors, (19096), 4 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:42,490 INFO L175 Difference]: Start difference. First operand has 165 places, 232 transitions, 3060 flow. Second operand 3 states and 5476 transitions. [2023-08-26 18:35:42,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 241 transitions, 3683 flow [2023-08-26 18:35:42,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 241 transitions, 3624 flow, removed 23 selfloop flow, removed 6 redundant places. [2023-08-26 18:35:42,513 INFO L231 Difference]: Finished difference. Result has 160 places, 230 transitions, 2970 flow [2023-08-26 18:35:42,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=2943, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2970, PETRI_PLACES=160, PETRI_TRANSITIONS=230} [2023-08-26 18:35:42,514 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -594 predicate places. [2023-08-26 18:35:42,514 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 230 transitions, 2970 flow [2023-08-26 18:35:42,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1818.0) internal successors, (5454), 3 states have internal predecessors, (5454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:42,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:35:42,515 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:35:42,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 18:35:42,515 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting StealerErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:35:42,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:35:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash 643078378, now seen corresponding path program 1 times [2023-08-26 18:35:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:35:42,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810503603] [2023-08-26 18:35:42,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:35:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:35:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:35:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:35:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:35:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810503603] [2023-08-26 18:35:43,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810503603] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:35:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664971786] [2023-08-26 18:35:43,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:35:43,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:35:43,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:35:43,725 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:35:43,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 18:35:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:35:44,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 89 conjunts are in the unsatisfiable core [2023-08-26 18:35:44,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:35:44,126 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-08-26 18:35:44,139 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:35:44,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:35:44,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:35:44,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:44,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:35:44,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:44,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:35:44,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:44,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:35:44,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:44,327 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:44,635 INFO L322 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-08-26 18:35:44,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 167 [2023-08-26 18:35:44,650 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:44,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 126 [2023-08-26 18:35:44,657 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 135 [2023-08-26 18:35:44,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 129 [2023-08-26 18:35:44,714 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:44,715 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-08-26 18:35:44,723 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:44,724 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2023-08-26 18:35:44,793 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-26 18:35:44,793 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2023-08-26 18:35:44,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 138 [2023-08-26 18:35:44,935 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-26 18:35:44,995 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-26 18:35:44,995 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 18:35:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:35:45,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:35:45,209 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 146 [2023-08-26 18:35:45,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2023-08-26 18:35:45,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 152 [2023-08-26 18:35:45,662 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:45,663 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 165 [2023-08-26 18:35:45,679 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-08-26 18:35:45,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 138 [2023-08-26 18:35:45,695 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:45,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 131 [2023-08-26 18:35:45,711 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:45,712 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 143 [2023-08-26 18:35:45,858 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:45,859 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:35:45,864 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:45,865 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:35:46,116 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-26 18:35:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:35:47,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664971786] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:35:47,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:35:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 36 [2023-08-26 18:35:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099913857] [2023-08-26 18:35:47,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:35:47,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-26 18:35:47,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:35:47,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-26 18:35:47,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1238, Unknown=21, NotChecked=0, Total=1406 [2023-08-26 18:35:47,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1246 out of 4774 [2023-08-26 18:35:47,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 230 transitions, 2970 flow. Second operand has 38 states, 38 states have (on average 1247.8684210526317) internal successors, (47419), 38 states have internal predecessors, (47419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:47,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:35:47,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1246 of 4774 [2023-08-26 18:35:47,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:35:49,792 INFO L124 PetriNetUnfolderBase]: 560/2186 cut-off events. [2023-08-26 18:35:49,792 INFO L125 PetriNetUnfolderBase]: For 21325/21325 co-relation queries the response was YES. [2023-08-26 18:35:49,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11703 conditions, 2186 events. 560/2186 cut-off events. For 21325/21325 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 15844 event pairs, 133 based on Foata normal form. 21/1943 useless extension candidates. Maximal degree in co-relation 11658. Up to 889 conditions per place. [2023-08-26 18:35:49,804 INFO L140 encePairwiseOnDemand]: 4757/4774 looper letters, 312 selfloop transitions, 127 changer transitions 2/442 dead transitions. [2023-08-26 18:35:49,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 442 transitions, 6512 flow [2023-08-26 18:35:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-26 18:35:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-26 18:35:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33820 transitions. [2023-08-26 18:35:49,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2623780043134882 [2023-08-26 18:35:49,825 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 33820 transitions. [2023-08-26 18:35:49,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33820 transitions. [2023-08-26 18:35:49,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:35:49,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 33820 transitions. [2023-08-26 18:35:49,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 1252.5925925925926) internal successors, (33820), 27 states have internal predecessors, (33820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:49,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 4774.0) internal successors, (133672), 28 states have internal predecessors, (133672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:49,920 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 4774.0) internal successors, (133672), 28 states have internal predecessors, (133672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:49,920 INFO L175 Difference]: Start difference. First operand has 160 places, 230 transitions, 2970 flow. Second operand 27 states and 33820 transitions. [2023-08-26 18:35:49,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 442 transitions, 6512 flow [2023-08-26 18:35:49,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 442 transitions, 6501 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:35:49,960 INFO L231 Difference]: Finished difference. Result has 203 places, 329 transitions, 5059 flow [2023-08-26 18:35:49,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=2967, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5059, PETRI_PLACES=203, PETRI_TRANSITIONS=329} [2023-08-26 18:35:49,960 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -551 predicate places. [2023-08-26 18:35:49,960 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 329 transitions, 5059 flow [2023-08-26 18:35:49,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1247.8684210526317) internal successors, (47419), 38 states have internal predecessors, (47419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:35:49,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:35:49,964 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:35:49,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 18:35:50,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-26 18:35:50,164 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting StealerErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:35:50,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:35:50,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1299992570, now seen corresponding path program 2 times [2023-08-26 18:35:50,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:35:50,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618533331] [2023-08-26 18:35:50,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:35:50,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:35:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:35:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:35:52,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:35:52,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618533331] [2023-08-26 18:35:52,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618533331] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:35:52,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157682230] [2023-08-26 18:35:52,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 18:35:52,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:35:52,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:35:52,678 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:35:52,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 18:35:53,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 18:35:53,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:35:53,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 159 conjunts are in the unsatisfiable core [2023-08-26 18:35:53,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:35:53,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-08-26 18:35:53,224 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:35:53,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:35:53,269 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:53,282 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:53,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:53,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:53,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:35:53,592 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 136 [2023-08-26 18:35:53,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 130 [2023-08-26 18:35:53,617 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:53,618 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 107 [2023-08-26 18:35:53,659 INFO L322 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2023-08-26 18:35:53,660 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 160 [2023-08-26 18:35:53,670 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:53,671 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2023-08-26 18:35:53,685 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 18:35:53,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 18:35:53,696 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-26 18:35:53,696 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2023-08-26 18:35:53,704 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-26 18:35:53,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2023-08-26 18:35:53,810 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-08-26 18:35:54,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2023-08-26 18:35:54,303 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 86 [2023-08-26 18:35:54,344 INFO L322 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2023-08-26 18:35:54,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 130 [2023-08-26 18:35:54,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 109 [2023-08-26 18:35:54,435 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-26 18:35:54,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-08-26 18:35:54,449 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-26 18:35:54,449 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2023-08-26 18:35:54,459 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-26 18:35:54,459 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2023-08-26 18:35:54,776 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:54,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 179 [2023-08-26 18:35:54,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 357 treesize of output 351 [2023-08-26 18:35:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:35:54,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:35:55,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 200 [2023-08-26 18:35:55,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 212 [2023-08-26 18:35:55,242 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:55,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 112 [2023-08-26 18:35:55,254 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:55,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2023-08-26 18:35:55,276 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:55,277 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:35:55,279 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:55,279 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:35:57,582 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:57,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 170 [2023-08-26 18:35:57,603 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:57,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 164 [2023-08-26 18:35:57,622 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 18:35:57,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 129 [2023-08-26 18:35:57,639 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:57,640 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 130 [2023-08-26 18:35:57,686 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:57,687 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:35:57,689 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:35:57,690 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:36:26,958 WARN L234 SmtUtils]: Spent 10.63s on a formula simplification that was a NOOP. DAG size: 141 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 18:36:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:36:27,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157682230] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:36:27,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:36:27,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 47 [2023-08-26 18:36:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739383242] [2023-08-26 18:36:27,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:36:27,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-08-26 18:36:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:36:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-08-26 18:36:27,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2147, Unknown=7, NotChecked=0, Total=2352 [2023-08-26 18:36:28,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1215 out of 4774 [2023-08-26 18:36:28,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 329 transitions, 5059 flow. Second operand has 49 states, 49 states have (on average 1216.408163265306) internal successors, (59604), 49 states have internal predecessors, (59604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:36:28,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:36:28,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1215 of 4774 [2023-08-26 18:36:28,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:36:30,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:36:32,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:37:01,853 WARN L234 SmtUtils]: Spent 17.68s on a formula simplification. DAG size of input: 99 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 18:37:09,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:37:19,704 WARN L234 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 78 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 18:37:24,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:37:38,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:37:51,059 INFO L124 PetriNetUnfolderBase]: 566/2216 cut-off events. [2023-08-26 18:37:51,059 INFO L125 PetriNetUnfolderBase]: For 26987/26987 co-relation queries the response was YES. [2023-08-26 18:37:51,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13302 conditions, 2216 events. 566/2216 cut-off events. For 26987/26987 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 16258 event pairs, 143 based on Foata normal form. 2/1947 useless extension candidates. Maximal degree in co-relation 13240. Up to 1611 conditions per place. [2023-08-26 18:37:51,077 INFO L140 encePairwiseOnDemand]: 4751/4774 looper letters, 288 selfloop transitions, 132 changer transitions 1/422 dead transitions. [2023-08-26 18:37:51,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 422 transitions, 6880 flow [2023-08-26 18:37:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-26 18:37:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-26 18:37:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47534 transitions. [2023-08-26 18:37:51,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25530383594899725 [2023-08-26 18:37:51,106 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 47534 transitions. [2023-08-26 18:37:51,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47534 transitions. [2023-08-26 18:37:51,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:37:51,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 47534 transitions. [2023-08-26 18:37:51,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 1218.820512820513) internal successors, (47534), 39 states have internal predecessors, (47534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:37:51,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 4774.0) internal successors, (190960), 40 states have internal predecessors, (190960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:37:51,246 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 4774.0) internal successors, (190960), 40 states have internal predecessors, (190960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:37:51,246 INFO L175 Difference]: Start difference. First operand has 203 places, 329 transitions, 5059 flow. Second operand 39 states and 47534 transitions. [2023-08-26 18:37:51,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 422 transitions, 6880 flow [2023-08-26 18:37:51,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 422 transitions, 6765 flow, removed 37 selfloop flow, removed 6 redundant places. [2023-08-26 18:37:51,318 INFO L231 Difference]: Finished difference. Result has 250 places, 374 transitions, 5960 flow [2023-08-26 18:37:51,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=4968, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=5960, PETRI_PLACES=250, PETRI_TRANSITIONS=374} [2023-08-26 18:37:51,318 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -504 predicate places. [2023-08-26 18:37:51,318 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 374 transitions, 5960 flow [2023-08-26 18:37:51,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1216.408163265306) internal successors, (59604), 49 states have internal predecessors, (59604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:37:51,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:37:51,324 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:37:51,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 18:37:51,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-26 18:37:51,524 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting StealerErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:37:51,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:37:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1400707153, now seen corresponding path program 1 times [2023-08-26 18:37:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:37:51,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944865643] [2023-08-26 18:37:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:37:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:37:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:37:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:37:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:37:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944865643] [2023-08-26 18:37:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944865643] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:37:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653873850] [2023-08-26 18:37:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:37:53,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:37:53,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:37:53,512 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:37:53,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 18:37:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:37:53,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 160 conjunts are in the unsatisfiable core [2023-08-26 18:37:53,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:37:53,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-08-26 18:37:53,864 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:37:53,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:37:53,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:37:53,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:37:53,977 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:37:53,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:37:54,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:37:54,354 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:37:54,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:37:54,579 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 18:37:54,580 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 40 [2023-08-26 18:37:58,762 INFO L322 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2023-08-26 18:37:58,762 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 154 [2023-08-26 18:37:58,788 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-26 18:37:58,788 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2023-08-26 18:37:58,802 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-26 18:37:59,003 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-26 18:37:59,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:37:59,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2023-08-26 18:37:59,258 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 18:37:59,258 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 18:37:59,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2023-08-26 18:37:59,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 108 [2023-08-26 18:37:59,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2023-08-26 18:37:59,565 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:37:59,565 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-08-26 18:37:59,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:37:59,570 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:37:59,570 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-08-26 18:37:59,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:37:59,576 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:37:59,577 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2023-08-26 18:37:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:37:59,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:37:59,848 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:37:59,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 107 [2023-08-26 18:37:59,861 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:37:59,862 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 101 [2023-08-26 18:37:59,885 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:37:59,885 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:37:59,888 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:37:59,889 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:38:00,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-26 18:38:00,929 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:38:00,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 170 [2023-08-26 18:38:01,098 INFO L322 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2023-08-26 18:38:01,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 257 treesize of output 299 [2023-08-26 18:38:01,148 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:38:01,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 156 [2023-08-26 18:38:04,178 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:38:04,178 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:38:04,188 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:38:04,189 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:38:14,289 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:38:14,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 901 treesize of output 895 [2023-08-26 18:38:49,107 WARN L234 SmtUtils]: Spent 20.00s on a formula simplification. DAG size of input: 265 DAG size of output: 230 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 18:39:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:39:12,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653873850] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:39:12,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:39:12,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 51 [2023-08-26 18:39:12,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591263322] [2023-08-26 18:39:12,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:39:12,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-08-26 18:39:12,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:39:12,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-08-26 18:39:12,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2438, Unknown=16, NotChecked=0, Total=2652 [2023-08-26 18:39:12,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1217 out of 4774 [2023-08-26 18:39:12,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 374 transitions, 5960 flow. Second operand has 52 states, 52 states have (on average 1218.3076923076924) internal successors, (63352), 52 states have internal predecessors, (63352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:39:12,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:39:12,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1217 of 4774 [2023-08-26 18:39:12,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:39:13,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:39:17,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:39:23,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:39:29,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:39:55,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:39:58,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:40:01,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:40:13,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:40:34,054 WARN L234 SmtUtils]: Spent 13.35s on a formula simplification that was a NOOP. DAG size: 280 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 18:40:36,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:40:40,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:40:43,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:40:44,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:40:45,664 INFO L124 PetriNetUnfolderBase]: 571/2269 cut-off events. [2023-08-26 18:40:45,664 INFO L125 PetriNetUnfolderBase]: For 28432/28432 co-relation queries the response was YES. [2023-08-26 18:40:45,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14250 conditions, 2269 events. 571/2269 cut-off events. For 28432/28432 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 16792 event pairs, 235 based on Foata normal form. 1/2002 useless extension candidates. Maximal degree in co-relation 14173. Up to 1980 conditions per place. [2023-08-26 18:40:45,686 INFO L140 encePairwiseOnDemand]: 4755/4774 looper letters, 357 selfloop transitions, 62 changer transitions 0/420 dead transitions. [2023-08-26 18:40:45,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 420 transitions, 7633 flow [2023-08-26 18:40:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 18:40:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 18:40:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25643 transitions. [2023-08-26 18:40:45,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25578031799229956 [2023-08-26 18:40:45,712 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 25643 transitions. [2023-08-26 18:40:45,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25643 transitions. [2023-08-26 18:40:45,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:40:45,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 25643 transitions. [2023-08-26 18:40:45,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 1221.095238095238) internal successors, (25643), 21 states have internal predecessors, (25643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:45,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 4774.0) internal successors, (105028), 22 states have internal predecessors, (105028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:45,786 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 4774.0) internal successors, (105028), 22 states have internal predecessors, (105028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:45,786 INFO L175 Difference]: Start difference. First operand has 250 places, 374 transitions, 5960 flow. Second operand 21 states and 25643 transitions. [2023-08-26 18:40:45,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 420 transitions, 7633 flow [2023-08-26 18:40:45,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 420 transitions, 7501 flow, removed 27 selfloop flow, removed 6 redundant places. [2023-08-26 18:40:45,864 INFO L231 Difference]: Finished difference. Result has 275 places, 415 transitions, 6861 flow [2023-08-26 18:40:45,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=5847, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=6861, PETRI_PLACES=275, PETRI_TRANSITIONS=415} [2023-08-26 18:40:45,864 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -479 predicate places. [2023-08-26 18:40:45,864 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 415 transitions, 6861 flow [2023-08-26 18:40:45,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1218.3076923076924) internal successors, (63352), 52 states have internal predecessors, (63352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:45,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:40:45,870 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:40:45,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-26 18:40:46,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-26 18:40:46,070 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting StealerErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:40:46,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:40:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1645058065, now seen corresponding path program 2 times [2023-08-26 18:40:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:40:46,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866781881] [2023-08-26 18:40:46,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:40:46,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:40:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:40:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:40:46,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:40:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866781881] [2023-08-26 18:40:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866781881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:40:46,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:40:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:40:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492941165] [2023-08-26 18:40:46,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:40:46,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:40:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:40:46,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:40:46,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:40:46,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1378 out of 4774 [2023-08-26 18:40:46,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 415 transitions, 6861 flow. Second operand has 5 states, 5 states have (on average 1382.6) internal successors, (6913), 5 states have internal predecessors, (6913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:46,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:40:46,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1378 of 4774 [2023-08-26 18:40:46,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:40:47,274 INFO L124 PetriNetUnfolderBase]: 571/2261 cut-off events. [2023-08-26 18:40:47,274 INFO L125 PetriNetUnfolderBase]: For 29755/29755 co-relation queries the response was YES. [2023-08-26 18:40:47,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14435 conditions, 2261 events. 571/2261 cut-off events. For 29755/29755 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 16405 event pairs, 243 based on Foata normal form. 0/2001 useless extension candidates. Maximal degree in co-relation 14346. Up to 1697 conditions per place. [2023-08-26 18:40:47,312 INFO L140 encePairwiseOnDemand]: 4768/4774 looper letters, 404 selfloop transitions, 30 changer transitions 2/437 dead transitions. [2023-08-26 18:40:47,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 437 transitions, 7876 flow [2023-08-26 18:40:47,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:40:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:40:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8352 transitions. [2023-08-26 18:40:47,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2915793883535819 [2023-08-26 18:40:47,324 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 8352 transitions. [2023-08-26 18:40:47,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 8352 transitions. [2023-08-26 18:40:47,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:40:47,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 8352 transitions. [2023-08-26 18:40:47,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1392.0) internal successors, (8352), 6 states have internal predecessors, (8352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:47,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 4774.0) internal successors, (33418), 7 states have internal predecessors, (33418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:47,354 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 4774.0) internal successors, (33418), 7 states have internal predecessors, (33418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:47,354 INFO L175 Difference]: Start difference. First operand has 275 places, 415 transitions, 6861 flow. Second operand 6 states and 8352 transitions. [2023-08-26 18:40:47,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 437 transitions, 7876 flow [2023-08-26 18:40:47,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 437 transitions, 7843 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-26 18:40:47,454 INFO L231 Difference]: Finished difference. Result has 279 places, 418 transitions, 6946 flow [2023-08-26 18:40:47,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=6828, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6946, PETRI_PLACES=279, PETRI_TRANSITIONS=418} [2023-08-26 18:40:47,455 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -475 predicate places. [2023-08-26 18:40:47,455 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 418 transitions, 6946 flow [2023-08-26 18:40:47,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1382.6) internal successors, (6913), 5 states have internal predecessors, (6913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:47,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:40:47,456 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:40:47,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-26 18:40:47,456 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting StealerErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:40:47,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:40:47,457 INFO L85 PathProgramCache]: Analyzing trace with hash -749475636, now seen corresponding path program 1 times [2023-08-26 18:40:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:40:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89929855] [2023-08-26 18:40:47,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:40:47,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:40:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:40:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:40:47,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:40:47,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89929855] [2023-08-26 18:40:47,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89929855] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:40:47,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:40:47,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:40:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982176075] [2023-08-26 18:40:47,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:40:47,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:40:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:40:47,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:40:47,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:40:47,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1507 out of 4774 [2023-08-26 18:40:47,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 418 transitions, 6946 flow. Second operand has 5 states, 5 states have (on average 1511.6) internal successors, (7558), 5 states have internal predecessors, (7558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:47,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:40:47,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1507 of 4774 [2023-08-26 18:40:47,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:40:48,891 INFO L124 PetriNetUnfolderBase]: 711/2783 cut-off events. [2023-08-26 18:40:48,892 INFO L125 PetriNetUnfolderBase]: For 36675/36675 co-relation queries the response was YES. [2023-08-26 18:40:48,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17940 conditions, 2783 events. 711/2783 cut-off events. For 36675/36675 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 21532 event pairs, 185 based on Foata normal form. 24/2604 useless extension candidates. Maximal degree in co-relation 17848. Up to 1202 conditions per place. [2023-08-26 18:40:48,920 INFO L140 encePairwiseOnDemand]: 4763/4774 looper letters, 415 selfloop transitions, 121 changer transitions 1/540 dead transitions. [2023-08-26 18:40:48,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 540 transitions, 9775 flow [2023-08-26 18:40:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:40:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:40:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10629 transitions. [2023-08-26 18:40:48,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3180621222095876 [2023-08-26 18:40:48,927 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 10629 transitions. [2023-08-26 18:40:48,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10629 transitions. [2023-08-26 18:40:48,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:40:48,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 10629 transitions. [2023-08-26 18:40:48,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 1518.4285714285713) internal successors, (10629), 7 states have internal predecessors, (10629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:48,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 4774.0) internal successors, (38192), 8 states have internal predecessors, (38192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:48,951 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 4774.0) internal successors, (38192), 8 states have internal predecessors, (38192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:48,951 INFO L175 Difference]: Start difference. First operand has 279 places, 418 transitions, 6946 flow. Second operand 7 states and 10629 transitions. [2023-08-26 18:40:48,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 540 transitions, 9775 flow [2023-08-26 18:40:49,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 540 transitions, 9737 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 18:40:49,074 INFO L231 Difference]: Finished difference. Result has 287 places, 476 transitions, 8292 flow [2023-08-26 18:40:49,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=6914, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8292, PETRI_PLACES=287, PETRI_TRANSITIONS=476} [2023-08-26 18:40:49,076 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -467 predicate places. [2023-08-26 18:40:49,076 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 476 transitions, 8292 flow [2023-08-26 18:40:49,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1511.6) internal successors, (7558), 5 states have internal predecessors, (7558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:49,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:40:49,077 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:40:49,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-26 18:40:49,077 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting StealerErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:40:49,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:40:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash -351317635, now seen corresponding path program 1 times [2023-08-26 18:40:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:40:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190227393] [2023-08-26 18:40:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:40:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:40:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:40:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:40:49,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:40:49,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190227393] [2023-08-26 18:40:49,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190227393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:40:49,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:40:49,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:40:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148106339] [2023-08-26 18:40:49,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:40:49,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:40:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:40:49,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:40:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:40:49,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1545 out of 4774 [2023-08-26 18:40:49,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 476 transitions, 8292 flow. Second operand has 6 states, 6 states have (on average 1549.1666666666667) internal successors, (9295), 6 states have internal predecessors, (9295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:49,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:40:49,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1545 of 4774 [2023-08-26 18:40:49,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:40:50,323 INFO L124 PetriNetUnfolderBase]: 693/2695 cut-off events. [2023-08-26 18:40:50,323 INFO L125 PetriNetUnfolderBase]: For 39787/39787 co-relation queries the response was YES. [2023-08-26 18:40:50,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18427 conditions, 2695 events. 693/2695 cut-off events. For 39787/39787 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 20476 event pairs, 289 based on Foata normal form. 48/2618 useless extension candidates. Maximal degree in co-relation 18331. Up to 2374 conditions per place. [2023-08-26 18:40:50,353 INFO L140 encePairwiseOnDemand]: 4769/4774 looper letters, 466 selfloop transitions, 8 changer transitions 6/482 dead transitions. [2023-08-26 18:40:50,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 482 transitions, 9413 flow [2023-08-26 18:40:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:40:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:40:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6227 transitions. [2023-08-26 18:40:50,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3260892333472979 [2023-08-26 18:40:50,358 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 6227 transitions. [2023-08-26 18:40:50,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 6227 transitions. [2023-08-26 18:40:50,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:40:50,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 6227 transitions. [2023-08-26 18:40:50,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 1556.75) internal successors, (6227), 4 states have internal predecessors, (6227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:50,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 4774.0) internal successors, (23870), 5 states have internal predecessors, (23870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:50,373 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 4774.0) internal successors, (23870), 5 states have internal predecessors, (23870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:50,373 INFO L175 Difference]: Start difference. First operand has 287 places, 476 transitions, 8292 flow. Second operand 4 states and 6227 transitions. [2023-08-26 18:40:50,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 482 transitions, 9413 flow [2023-08-26 18:40:50,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 482 transitions, 9407 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:40:50,513 INFO L231 Difference]: Finished difference. Result has 287 places, 474 transitions, 8294 flow [2023-08-26 18:40:50,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=8278, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8294, PETRI_PLACES=287, PETRI_TRANSITIONS=474} [2023-08-26 18:40:50,514 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -467 predicate places. [2023-08-26 18:40:50,514 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 474 transitions, 8294 flow [2023-08-26 18:40:50,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1549.1666666666667) internal successors, (9295), 6 states have internal predecessors, (9295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:50,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:40:50,515 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:40:50,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-26 18:40:50,516 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:40:50,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:40:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash -351317636, now seen corresponding path program 1 times [2023-08-26 18:40:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:40:50,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850110369] [2023-08-26 18:40:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:40:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:40:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:40:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:40:50,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:40:50,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850110369] [2023-08-26 18:40:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850110369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:40:50,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:40:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:40:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368820963] [2023-08-26 18:40:50,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:40:50,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:40:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:40:50,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:40:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:40:50,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1517 out of 4774 [2023-08-26 18:40:50,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 474 transitions, 8294 flow. Second operand has 4 states, 4 states have (on average 1523.25) internal successors, (6093), 4 states have internal predecessors, (6093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:50,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:40:50,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1517 of 4774 [2023-08-26 18:40:50,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:40:51,663 INFO L124 PetriNetUnfolderBase]: 669/2622 cut-off events. [2023-08-26 18:40:51,664 INFO L125 PetriNetUnfolderBase]: For 38984/38984 co-relation queries the response was YES. [2023-08-26 18:40:51,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18044 conditions, 2622 events. 669/2622 cut-off events. For 38984/38984 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 19765 event pairs, 182 based on Foata normal form. 39/2536 useless extension candidates. Maximal degree in co-relation 17947. Up to 1449 conditions per place. [2023-08-26 18:40:51,693 INFO L140 encePairwiseOnDemand]: 4768/4774 looper letters, 449 selfloop transitions, 47 changer transitions 6/505 dead transitions. [2023-08-26 18:40:51,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 505 transitions, 9863 flow [2023-08-26 18:40:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:40:51,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:40:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7641 transitions. [2023-08-26 18:40:51,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3201089233347298 [2023-08-26 18:40:51,698 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 7641 transitions. [2023-08-26 18:40:51,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 7641 transitions. [2023-08-26 18:40:51,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:40:51,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 7641 transitions. [2023-08-26 18:40:51,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1528.2) internal successors, (7641), 5 states have internal predecessors, (7641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:51,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 4774.0) internal successors, (28644), 6 states have internal predecessors, (28644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:51,715 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 4774.0) internal successors, (28644), 6 states have internal predecessors, (28644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:51,715 INFO L175 Difference]: Start difference. First operand has 287 places, 474 transitions, 8294 flow. Second operand 5 states and 7641 transitions. [2023-08-26 18:40:51,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 505 transitions, 9863 flow [2023-08-26 18:40:51,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 505 transitions, 9847 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:40:51,858 INFO L231 Difference]: Finished difference. Result has 287 places, 473 transitions, 8368 flow [2023-08-26 18:40:51,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=8274, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8368, PETRI_PLACES=287, PETRI_TRANSITIONS=473} [2023-08-26 18:40:51,858 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -467 predicate places. [2023-08-26 18:40:51,858 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 473 transitions, 8368 flow [2023-08-26 18:40:51,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1523.25) internal successors, (6093), 4 states have internal predecessors, (6093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:51,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:40:51,859 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:40:51,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-26 18:40:51,859 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:40:51,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:40:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1214178826, now seen corresponding path program 1 times [2023-08-26 18:40:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:40:51,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529065327] [2023-08-26 18:40:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:40:51,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:40:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:40:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:40:51,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:40:51,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529065327] [2023-08-26 18:40:51,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529065327] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:40:51,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58968652] [2023-08-26 18:40:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:40:51,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:40:51,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:40:51,953 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:40:51,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-26 18:40:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:40:52,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 18:40:52,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:40:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:40:52,414 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 18:40:52,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58968652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:40:52,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 18:40:52,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-26 18:40:52,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114626798] [2023-08-26 18:40:52,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:40:52,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:40:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:40:52,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:40:52,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:40:52,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1810 out of 4774 [2023-08-26 18:40:52,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 473 transitions, 8368 flow. Second operand has 4 states, 4 states have (on average 1816.25) internal successors, (7265), 4 states have internal predecessors, (7265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:52,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:40:52,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1810 of 4774 [2023-08-26 18:40:52,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:40:52,675 INFO L124 PetriNetUnfolderBase]: 57/446 cut-off events. [2023-08-26 18:40:52,675 INFO L125 PetriNetUnfolderBase]: For 8235/8235 co-relation queries the response was YES. [2023-08-26 18:40:52,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 446 events. 57/446 cut-off events. For 8235/8235 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2911 event pairs, 8 based on Foata normal form. 33/453 useless extension candidates. Maximal degree in co-relation 3454. Up to 333 conditions per place. [2023-08-26 18:40:52,679 INFO L140 encePairwiseOnDemand]: 4770/4774 looper letters, 133 selfloop transitions, 2 changer transitions 56/198 dead transitions. [2023-08-26 18:40:52,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 198 transitions, 4060 flow [2023-08-26 18:40:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:40:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:40:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7277 transitions. [2023-08-26 18:40:52,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3810745705906996 [2023-08-26 18:40:52,686 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 7277 transitions. [2023-08-26 18:40:52,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 7277 transitions. [2023-08-26 18:40:52,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:40:52,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 7277 transitions. [2023-08-26 18:40:52,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 1819.25) internal successors, (7277), 4 states have internal predecessors, (7277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:52,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 4774.0) internal successors, (23870), 5 states have internal predecessors, (23870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:52,700 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 4774.0) internal successors, (23870), 5 states have internal predecessors, (23870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:52,700 INFO L175 Difference]: Start difference. First operand has 287 places, 473 transitions, 8368 flow. Second operand 4 states and 7277 transitions. [2023-08-26 18:40:52,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 198 transitions, 4060 flow [2023-08-26 18:40:52,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 198 transitions, 3107 flow, removed 14 selfloop flow, removed 55 redundant places. [2023-08-26 18:40:52,729 INFO L231 Difference]: Finished difference. Result has 210 places, 142 transitions, 1819 flow [2023-08-26 18:40:52,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=2620, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1819, PETRI_PLACES=210, PETRI_TRANSITIONS=142} [2023-08-26 18:40:52,730 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -544 predicate places. [2023-08-26 18:40:52,730 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 142 transitions, 1819 flow [2023-08-26 18:40:52,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1816.25) internal successors, (7265), 4 states have internal predecessors, (7265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:40:52,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:40:52,731 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:40:52,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-26 18:40:52,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-08-26 18:40:52,932 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:40:52,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:40:52,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1994062893, now seen corresponding path program 1 times [2023-08-26 18:40:52,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:40:52,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893127848] [2023-08-26 18:40:52,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:40:52,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:40:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:40:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:40:54,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:40:54,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893127848] [2023-08-26 18:40:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893127848] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:40:54,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33436760] [2023-08-26 18:40:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:40:54,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:40:54,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:40:54,737 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:40:54,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-26 18:40:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:40:55,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 162 conjunts are in the unsatisfiable core [2023-08-26 18:40:55,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:40:55,125 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:40:55,125 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:40:55,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-08-26 18:40:55,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:40:55,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:40:55,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:40:55,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:40:55,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:40:55,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:40:55,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:40:55,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:40:55,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 126 [2023-08-26 18:40:55,917 INFO L322 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2023-08-26 18:40:55,918 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 148 [2023-08-26 18:40:55,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:40:55,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-26 18:40:55,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:40:55,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-08-26 18:40:56,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:40:56,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:40:56,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2023-08-26 18:40:56,109 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-26 18:40:56,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2023-08-26 18:40:56,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-26 18:40:56,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:40:56,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2023-08-26 18:40:56,573 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 18:40:56,573 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 18:40:56,846 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2023-08-26 18:40:56,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 75 [2023-08-26 18:40:56,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 102 [2023-08-26 18:40:56,867 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:40:56,867 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2023-08-26 18:40:56,876 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-08-26 18:40:56,879 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:40:56,879 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-08-26 18:40:56,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:40:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:40:57,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:40:57,135 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:40:57,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 107 [2023-08-26 18:40:57,148 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:40:57,148 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 101 [2023-08-26 18:40:57,169 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:40:57,170 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:40:57,175 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:40:57,176 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:40:57,313 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-26 18:40:58,312 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:40:58,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 170 [2023-08-26 18:40:58,446 INFO L322 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2023-08-26 18:40:58,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 276 treesize of output 318 [2023-08-26 18:40:58,477 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:40:58,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 156 [2023-08-26 18:40:58,577 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:40:58,577 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:41:08,576 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:41:08,577 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:41:13,804 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:41:13,804 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 747 treesize of output 739 [2023-08-26 18:41:25,928 WARN L234 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 193 DAG size of output: 184 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 18:42:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 5 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:42:08,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33436760] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:42:08,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:42:08,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 20] total 53 [2023-08-26 18:42:08,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857753835] [2023-08-26 18:42:08,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:42:08,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-26 18:42:08,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:42:08,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-26 18:42:08,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2619, Unknown=42, NotChecked=0, Total=2862 [2023-08-26 18:42:08,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1217 out of 4774 [2023-08-26 18:42:08,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 142 transitions, 1819 flow. Second operand has 54 states, 54 states have (on average 1218.351851851852) internal successors, (65791), 54 states have internal predecessors, (65791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:42:08,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:42:08,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1217 of 4774 [2023-08-26 18:42:08,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:42:15,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:42:35,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:42:39,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:42:48,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:42:49,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:42:51,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:42:54,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:42:58,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:43:00,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:43:03,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:43:05,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:43:07,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:43:10,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:43:12,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:43:15,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:43:19,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:43:22,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:43:24,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:43:26,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:43:29,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 18:43:36,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 18:43:37,766 INFO L124 PetriNetUnfolderBase]: 28/274 cut-off events. [2023-08-26 18:43:37,766 INFO L125 PetriNetUnfolderBase]: For 2050/2050 co-relation queries the response was YES. [2023-08-26 18:43:37,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 274 events. 28/274 cut-off events. For 2050/2050 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1502 event pairs, 2 based on Foata normal form. 2/255 useless extension candidates. Maximal degree in co-relation 1692. Up to 194 conditions per place. [2023-08-26 18:43:37,768 INFO L140 encePairwiseOnDemand]: 4757/4774 looper letters, 107 selfloop transitions, 32 changer transitions 15/155 dead transitions. [2023-08-26 18:43:37,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 155 transitions, 2304 flow [2023-08-26 18:43:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-26 18:43:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-26 18:43:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20748 transitions. [2023-08-26 18:43:37,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2556494738657927 [2023-08-26 18:43:37,788 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 20748 transitions. [2023-08-26 18:43:37,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20748 transitions. [2023-08-26 18:43:37,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:43:37,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 20748 transitions. [2023-08-26 18:43:37,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 1220.4705882352941) internal successors, (20748), 17 states have internal predecessors, (20748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:43:37,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 4774.0) internal successors, (85932), 18 states have internal predecessors, (85932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:43:37,851 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 4774.0) internal successors, (85932), 18 states have internal predecessors, (85932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:43:37,852 INFO L175 Difference]: Start difference. First operand has 210 places, 142 transitions, 1819 flow. Second operand 17 states and 20748 transitions. [2023-08-26 18:43:37,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 155 transitions, 2304 flow [2023-08-26 18:43:37,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 155 transitions, 2058 flow, removed 23 selfloop flow, removed 17 redundant places. [2023-08-26 18:43:37,864 INFO L231 Difference]: Finished difference. Result has 201 places, 140 transitions, 1676 flow [2023-08-26 18:43:37,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4774, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1676, PETRI_PLACES=201, PETRI_TRANSITIONS=140} [2023-08-26 18:43:37,864 INFO L281 CegarLoopForPetriNet]: 754 programPoint places, -553 predicate places. [2023-08-26 18:43:37,864 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 140 transitions, 1676 flow [2023-08-26 18:43:37,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1218.351851851852) internal successors, (65791), 54 states have internal predecessors, (65791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:43:37,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:43:37,870 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:43:37,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-26 18:43:38,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-26 18:43:38,071 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 560 more)] === [2023-08-26 18:43:38,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:43:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1963126563, now seen corresponding path program 2 times [2023-08-26 18:43:38,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:43:38,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588895628] [2023-08-26 18:43:38,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:43:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:43:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:43:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:43:39,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:43:39,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588895628] [2023-08-26 18:43:39,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588895628] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:43:39,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13302537] [2023-08-26 18:43:39,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 18:43:39,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:43:39,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:43:39,583 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:43:39,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-26 18:43:40,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 18:43:40,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:43:40,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 171 conjunts are in the unsatisfiable core [2023-08-26 18:43:40,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:43:40,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-08-26 18:43:40,845 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:43:40,845 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:43:40,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:43:40,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:43:40,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:43:40,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:43:40,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:43:40,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:43:40,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:43:40,943 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:43:40,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-26 18:43:41,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 126 [2023-08-26 18:43:41,275 INFO L322 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2023-08-26 18:43:41,275 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 164 [2023-08-26 18:43:41,284 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-26 18:43:41,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2023-08-26 18:43:41,297 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:43:41,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-08-26 18:43:41,310 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-26 18:43:41,310 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2023-08-26 18:43:41,505 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-26 18:43:41,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 18:43:41,662 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-26 18:43:41,663 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 64 [2023-08-26 18:43:41,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-08-26 18:43:41,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2023-08-26 18:43:41,954 INFO L322 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-08-26 18:43:41,955 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-08-26 18:43:42,195 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2023-08-26 18:43:42,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 75 [2023-08-26 18:43:42,210 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 105 [2023-08-26 18:43:42,235 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-08-26 18:43:42,238 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:43:42,239 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-08-26 18:43:42,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:43:42,244 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:43:42,245 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-08-26 18:43:42,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:43:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:43:42,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:43:42,383 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-26 18:43:42,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-26 18:43:42,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-26 18:43:42,722 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:43:42,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 107 [2023-08-26 18:43:42,739 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:43:42,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 101 [2023-08-26 18:43:42,775 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:43:42,776 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:43:42,778 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:43:42,779 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2023-08-26 18:43:43,495 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-26 18:43:51,542 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:43:51,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 170 [2023-08-26 18:43:54,276 INFO L322 Elim1Store]: treesize reduction 24, result has 89.3 percent of original size [2023-08-26 18:43:54,276 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 635 treesize of output 815 [2023-08-26 18:43:54,379 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:43:54,380 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 136 [2023-08-26 18:43:54,460 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:43:54,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 148 Received shutdown request... [2023-08-26 18:44:19,487 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-26 18:44:19,488 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (562 of 563 remaining) [2023-08-26 18:44:19,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-26 18:44:19,519 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 18:44:19,519 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 18:44:19,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:44:19,689 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. [2023-08-26 18:44:19,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (561 of 563 remaining) [2023-08-26 18:44:19,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE (560 of 563 remaining) [2023-08-26 18:44:19,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (559 of 563 remaining) [2023-08-26 18:44:19,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr245ASSERT_VIOLATIONASSERT (558 of 563 remaining) [2023-08-26 18:44:19,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr242REQUIRES_VIOLATIONMEMORY_DEREFERENCE (557 of 563 remaining) [2023-08-26 18:44:19,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE (556 of 563 remaining) [2023-08-26 18:44:19,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr410REQUIRES_VIOLATIONMEMORY_DEREFERENCE (555 of 563 remaining) [2023-08-26 18:44:19,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (554 of 563 remaining) [2023-08-26 18:44:19,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE (553 of 563 remaining) [2023-08-26 18:44:19,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (552 of 563 remaining) [2023-08-26 18:44:19,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (551 of 563 remaining) [2023-08-26 18:44:19,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr402REQUIRES_VIOLATIONMEMORY_DEREFERENCE (550 of 563 remaining) [2023-08-26 18:44:19,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (549 of 563 remaining) [2023-08-26 18:44:19,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr291REQUIRES_VIOLATIONMEMORY_DEREFERENCE (548 of 563 remaining) [2023-08-26 18:44:19,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr285REQUIRES_VIOLATIONMEMORY_DEREFERENCE (547 of 563 remaining) [2023-08-26 18:44:19,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (546 of 563 remaining) [2023-08-26 18:44:19,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE (545 of 563 remaining) [2023-08-26 18:44:19,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (544 of 563 remaining) [2023-08-26 18:44:19,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (543 of 563 remaining) [2023-08-26 18:44:19,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (542 of 563 remaining) [2023-08-26 18:44:19,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (541 of 563 remaining) [2023-08-26 18:44:19,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr375REQUIRES_VIOLATIONMEMORY_DEREFERENCE (540 of 563 remaining) [2023-08-26 18:44:19,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr387REQUIRES_VIOLATIONMEMORY_DEREFERENCE (539 of 563 remaining) [2023-08-26 18:44:19,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (538 of 563 remaining) [2023-08-26 18:44:19,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE (537 of 563 remaining) [2023-08-26 18:44:19,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr388REQUIRES_VIOLATIONMEMORY_DEREFERENCE (536 of 563 remaining) [2023-08-26 18:44:19,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (535 of 563 remaining) [2023-08-26 18:44:19,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (534 of 563 remaining) [2023-08-26 18:44:19,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (533 of 563 remaining) [2023-08-26 18:44:19,694 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (532 of 563 remaining) [2023-08-26 18:44:19,694 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (531 of 563 remaining) [2023-08-26 18:44:19,694 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr222ASSERT_VIOLATIONASSERT (530 of 563 remaining) [2023-08-26 18:44:19,694 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (529 of 563 remaining) [2023-08-26 18:44:19,694 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr460REQUIRES_VIOLATIONMEMORY_DEREFERENCE (528 of 563 remaining) [2023-08-26 18:44:19,694 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr239REQUIRES_VIOLATIONMEMORY_DEREFERENCE (527 of 563 remaining) [2023-08-26 18:44:19,694 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (526 of 563 remaining) [2023-08-26 18:44:19,694 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr360REQUIRES_VIOLATIONMEMORY_DEREFERENCE (525 of 563 remaining) [2023-08-26 18:44:19,694 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr283REQUIRES_VIOLATIONMEMORY_DEREFERENCE (524 of 563 remaining) [2023-08-26 18:44:19,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (523 of 563 remaining) [2023-08-26 18:44:19,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE (522 of 563 remaining) [2023-08-26 18:44:19,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr336REQUIRES_VIOLATIONMEMORY_DEREFERENCE (521 of 563 remaining) [2023-08-26 18:44:19,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr338REQUIRES_VIOLATIONMEMORY_DEREFERENCE (520 of 563 remaining) [2023-08-26 18:44:19,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (519 of 563 remaining) [2023-08-26 18:44:19,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE (518 of 563 remaining) [2023-08-26 18:44:19,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr321REQUIRES_VIOLATIONMEMORY_DEREFERENCE (517 of 563 remaining) [2023-08-26 18:44:19,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr393REQUIRES_VIOLATIONMEMORY_DEREFERENCE (516 of 563 remaining) [2023-08-26 18:44:19,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (515 of 563 remaining) [2023-08-26 18:44:19,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr255REQUIRES_VIOLATIONMEMORY_DEREFERENCE (514 of 563 remaining) [2023-08-26 18:44:19,696 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr474ASSERT_VIOLATIONASSERT (513 of 563 remaining) [2023-08-26 18:44:19,696 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr295REQUIRES_VIOLATIONMEMORY_DEREFERENCE (512 of 563 remaining) [2023-08-26 18:44:19,696 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (511 of 563 remaining) [2023-08-26 18:44:19,696 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr471REQUIRES_VIOLATIONMEMORY_DEREFERENCE (510 of 563 remaining) [2023-08-26 18:44:19,696 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr337REQUIRES_VIOLATIONMEMORY_DEREFERENCE (509 of 563 remaining) [2023-08-26 18:44:19,696 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr287REQUIRES_VIOLATIONMEMORY_DEREFERENCE (508 of 563 remaining) [2023-08-26 18:44:19,696 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr278REQUIRES_VIOLATIONMEMORY_DEREFERENCE (507 of 563 remaining) [2023-08-26 18:44:19,696 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (506 of 563 remaining) [2023-08-26 18:44:19,696 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr374REQUIRES_VIOLATIONMEMORY_DEREFERENCE (505 of 563 remaining) [2023-08-26 18:44:19,697 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr223REQUIRES_VIOLATIONMEMORY_DEREFERENCE (504 of 563 remaining) [2023-08-26 18:44:19,697 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (503 of 563 remaining) [2023-08-26 18:44:19,697 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr185REQUIRES_VIOLATIONMEMORY_DEREFERENCE (502 of 563 remaining) [2023-08-26 18:44:19,697 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (501 of 563 remaining) [2023-08-26 18:44:19,697 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (500 of 563 remaining) [2023-08-26 18:44:19,697 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr440REQUIRES_VIOLATIONMEMORY_DEREFERENCE (499 of 563 remaining) [2023-08-26 18:44:19,697 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE (498 of 563 remaining) [2023-08-26 18:44:19,697 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr282REQUIRES_VIOLATIONMEMORY_DEREFERENCE (497 of 563 remaining) [2023-08-26 18:44:19,697 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (496 of 563 remaining) [2023-08-26 18:44:19,697 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (495 of 563 remaining) [2023-08-26 18:44:19,698 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr472REQUIRES_VIOLATIONMEMORY_DEREFERENCE (494 of 563 remaining) [2023-08-26 18:44:19,698 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (493 of 563 remaining) [2023-08-26 18:44:19,698 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (492 of 563 remaining) [2023-08-26 18:44:19,698 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE (491 of 563 remaining) [2023-08-26 18:44:19,698 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr343REQUIRES_VIOLATIONMEMORY_DEREFERENCE (490 of 563 remaining) [2023-08-26 18:44:19,698 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr398REQUIRES_VIOLATIONMEMORY_DEREFERENCE (489 of 563 remaining) [2023-08-26 18:44:19,698 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE (488 of 563 remaining) [2023-08-26 18:44:19,698 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr98ASSERT_VIOLATIONASSERT (487 of 563 remaining) [2023-08-26 18:44:19,698 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (486 of 563 remaining) [2023-08-26 18:44:19,699 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE (485 of 563 remaining) [2023-08-26 18:44:19,699 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr389REQUIRES_VIOLATIONMEMORY_DEREFERENCE (484 of 563 remaining) [2023-08-26 18:44:19,699 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE (483 of 563 remaining) [2023-08-26 18:44:19,699 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (482 of 563 remaining) [2023-08-26 18:44:19,699 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr346REQUIRES_VIOLATIONMEMORY_DEREFERENCE (481 of 563 remaining) [2023-08-26 18:44:19,699 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (480 of 563 remaining) [2023-08-26 18:44:19,699 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE (479 of 563 remaining) [2023-08-26 18:44:19,699 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr449REQUIRES_VIOLATIONMEMORY_DEREFERENCE (478 of 563 remaining) [2023-08-26 18:44:19,699 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE (477 of 563 remaining) [2023-08-26 18:44:19,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE (476 of 563 remaining) [2023-08-26 18:44:19,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr382REQUIRES_VIOLATIONMEMORY_DEREFERENCE (475 of 563 remaining) [2023-08-26 18:44:19,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr426REQUIRES_VIOLATIONMEMORY_DEREFERENCE (474 of 563 remaining) [2023-08-26 18:44:19,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr447REQUIRES_VIOLATIONMEMORY_DEREFERENCE (473 of 563 remaining) [2023-08-26 18:44:19,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (472 of 563 remaining) [2023-08-26 18:44:19,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (471 of 563 remaining) [2023-08-26 18:44:19,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (470 of 563 remaining) [2023-08-26 18:44:19,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr121ASSERT_VIOLATIONASSERT (469 of 563 remaining) [2023-08-26 18:44:19,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE (468 of 563 remaining) [2023-08-26 18:44:19,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE (467 of 563 remaining) [2023-08-26 18:44:19,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (466 of 563 remaining) [2023-08-26 18:44:19,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr349REQUIRES_VIOLATIONMEMORY_DEREFERENCE (465 of 563 remaining) [2023-08-26 18:44:19,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr251REQUIRES_VIOLATIONMEMORY_DEREFERENCE (464 of 563 remaining) [2023-08-26 18:44:19,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr392REQUIRES_VIOLATIONMEMORY_DEREFERENCE (463 of 563 remaining) [2023-08-26 18:44:19,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr390REQUIRES_VIOLATIONMEMORY_DEREFERENCE (462 of 563 remaining) [2023-08-26 18:44:19,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (461 of 563 remaining) [2023-08-26 18:44:19,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (460 of 563 remaining) [2023-08-26 18:44:19,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE (459 of 563 remaining) [2023-08-26 18:44:19,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr335REQUIRES_VIOLATIONMEMORY_DEREFERENCE (458 of 563 remaining) [2023-08-26 18:44:19,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr357REQUIRES_VIOLATIONMEMORY_DEREFERENCE (457 of 563 remaining) [2023-08-26 18:44:19,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr175REQUIRES_VIOLATIONMEMORY_DEREFERENCE (456 of 563 remaining) [2023-08-26 18:44:19,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr274REQUIRES_VIOLATIONMEMORY_DEREFERENCE (455 of 563 remaining) [2023-08-26 18:44:19,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (454 of 563 remaining) [2023-08-26 18:44:19,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE (453 of 563 remaining) [2023-08-26 18:44:19,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr467REQUIRES_VIOLATIONMEMORY_DEREFERENCE (452 of 563 remaining) [2023-08-26 18:44:19,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr235REQUIRES_VIOLATIONMEMORY_DEREFERENCE (451 of 563 remaining) [2023-08-26 18:44:19,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr394REQUIRES_VIOLATIONMEMORY_DEREFERENCE (450 of 563 remaining) [2023-08-26 18:44:19,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr180REQUIRES_VIOLATIONMEMORY_DEREFERENCE (449 of 563 remaining) [2023-08-26 18:44:19,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr342REQUIRES_VIOLATIONMEMORY_DEREFERENCE (448 of 563 remaining) [2023-08-26 18:44:19,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (447 of 563 remaining) [2023-08-26 18:44:19,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (446 of 563 remaining) [2023-08-26 18:44:19,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (445 of 563 remaining) [2023-08-26 18:44:19,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (444 of 563 remaining) [2023-08-26 18:44:19,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE (443 of 563 remaining) [2023-08-26 18:44:19,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE (442 of 563 remaining) [2023-08-26 18:44:19,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr328REQUIRES_VIOLATIONMEMORY_DEREFERENCE (441 of 563 remaining) [2023-08-26 18:44:19,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE (440 of 563 remaining) [2023-08-26 18:44:19,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE (439 of 563 remaining) [2023-08-26 18:44:19,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr257REQUIRES_VIOLATIONMEMORY_DEREFERENCE (438 of 563 remaining) [2023-08-26 18:44:19,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (437 of 563 remaining) [2023-08-26 18:44:19,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE (436 of 563 remaining) [2023-08-26 18:44:19,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (435 of 563 remaining) [2023-08-26 18:44:19,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr293REQUIRES_VIOLATIONMEMORY_DEREFERENCE (434 of 563 remaining) [2023-08-26 18:44:19,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr240REQUIRES_VIOLATIONMEMORY_DEREFERENCE (433 of 563 remaining) [2023-08-26 18:44:19,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (432 of 563 remaining) [2023-08-26 18:44:19,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (431 of 563 remaining) [2023-08-26 18:44:19,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr462REQUIRES_VIOLATIONMEMORY_DEREFERENCE (430 of 563 remaining) [2023-08-26 18:44:19,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr262REQUIRES_VIOLATIONMEMORY_DEREFERENCE (429 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE (428 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE (427 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (426 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr332REQUIRES_VIOLATIONMEMORY_DEREFERENCE (425 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr196REQUIRES_VIOLATIONMEMORY_DEREFERENCE (424 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE (423 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr333REQUIRES_VIOLATIONMEMORY_DEREFERENCE (422 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE (421 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr277REQUIRES_VIOLATIONMEMORY_DEREFERENCE (420 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (419 of 563 remaining) [2023-08-26 18:44:19,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE (418 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (417 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr350REQUIRES_VIOLATIONMEMORY_DEREFERENCE (416 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr356REQUIRES_VIOLATIONMEMORY_DEREFERENCE (415 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE (414 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr182REQUIRES_VIOLATIONMEMORY_DEREFERENCE (413 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE (412 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr246REQUIRES_VIOLATIONMEMORY_DEREFERENCE (411 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr451REQUIRES_VIOLATIONMEMORY_DEREFERENCE (410 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr359REQUIRES_VIOLATIONMEMORY_DEREFERENCE (409 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr431REQUIRES_VIOLATIONMEMORY_DEREFERENCE (408 of 563 remaining) [2023-08-26 18:44:19,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr191REQUIRES_VIOLATIONMEMORY_DEREFERENCE (407 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE (406 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (405 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr450REQUIRES_VIOLATIONMEMORY_DEREFERENCE (404 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE (403 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (402 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (401 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (400 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr436REQUIRES_VIOLATIONMEMORY_DEREFERENCE (399 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (398 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr378REQUIRES_VIOLATIONMEMORY_DEREFERENCE (397 of 563 remaining) [2023-08-26 18:44:19,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr432REQUIRES_VIOLATIONMEMORY_DEREFERENCE (396 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (395 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (394 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (393 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (392 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (391 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE (390 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr206REQUIRES_VIOLATIONMEMORY_DEREFERENCE (389 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr327REQUIRES_VIOLATIONMEMORY_DEREFERENCE (388 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr252REQUIRES_VIOLATIONMEMORY_DEREFERENCE (387 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (386 of 563 remaining) [2023-08-26 18:44:19,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr461REQUIRES_VIOLATIONMEMORY_DEREFERENCE (385 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE (384 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr289REQUIRES_VIOLATIONMEMORY_DEREFERENCE (383 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr448REQUIRES_VIOLATIONMEMORY_DEREFERENCE (382 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE (381 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr457REQUIRES_VIOLATIONMEMORY_DEREFERENCE (380 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr371REQUIRES_VIOLATIONMEMORY_DEREFERENCE (379 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr458REQUIRES_VIOLATIONMEMORY_DEREFERENCE (378 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr201REQUIRES_VIOLATIONMEMORY_DEREFERENCE (377 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr247REQUIRES_VIOLATIONMEMORY_DEREFERENCE (376 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE (375 of 563 remaining) [2023-08-26 18:44:19,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr202REQUIRES_VIOLATIONMEMORY_DEREFERENCE (374 of 563 remaining) [2023-08-26 18:44:19,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (373 of 563 remaining) [2023-08-26 18:44:19,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (372 of 563 remaining) [2023-08-26 18:44:19,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE (371 of 563 remaining) [2023-08-26 18:44:19,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (370 of 563 remaining) [2023-08-26 18:44:19,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr455REQUIRES_VIOLATIONMEMORY_DEREFERENCE (369 of 563 remaining) [2023-08-26 18:44:19,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr367REQUIRES_VIOLATIONMEMORY_DEREFERENCE (368 of 563 remaining) [2023-08-26 18:44:19,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (367 of 563 remaining) [2023-08-26 18:44:19,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE (366 of 563 remaining) [2023-08-26 18:44:19,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE (365 of 563 remaining) [2023-08-26 18:44:19,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr232REQUIRES_VIOLATIONMEMORY_DEREFERENCE (364 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (363 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (362 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (361 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr465REQUIRES_VIOLATIONMEMORY_DEREFERENCE (360 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE (359 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE (358 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE (357 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE (356 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE (355 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr267REQUIRES_VIOLATIONMEMORY_DEREFERENCE (354 of 563 remaining) [2023-08-26 18:44:19,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE (353 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr298REQUIRES_VIOLATIONMEMORY_DEREFERENCE (352 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr241REQUIRES_VIOLATIONMEMORY_DEREFERENCE (351 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (350 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (349 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (348 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (347 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr234REQUIRES_VIOLATIONMEMORY_DEREFERENCE (346 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (345 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr446REQUIRES_VIOLATIONMEMORY_DEREFERENCE (344 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (343 of 563 remaining) [2023-08-26 18:44:19,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr199REQUIRES_VIOLATIONMEMORY_DEREFERENCE (342 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE (341 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr443REQUIRES_VIOLATIONMEMORY_DEREFERENCE (340 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr214REQUIRES_VIOLATIONMEMORY_DEREFERENCE (339 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (338 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr401REQUIRES_VIOLATIONMEMORY_DEREFERENCE (337 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr473REQUIRES_VIOLATIONMEMORY_DEREFERENCE (336 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE (335 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (334 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr434REQUIRES_VIOLATIONMEMORY_DEREFERENCE (333 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr269REQUIRES_VIOLATIONMEMORY_DEREFERENCE (332 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (331 of 563 remaining) [2023-08-26 18:44:19,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (330 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr439REQUIRES_VIOLATIONMEMORY_DEREFERENCE (329 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE (328 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE (327 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr275REQUIRES_VIOLATIONMEMORY_DEREFERENCE (326 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE (325 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (324 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (323 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr438REQUIRES_VIOLATIONMEMORY_DEREFERENCE (322 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr442REQUIRES_VIOLATIONMEMORY_DEREFERENCE (321 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (320 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr441REQUIRES_VIOLATIONMEMORY_DEREFERENCE (319 of 563 remaining) [2023-08-26 18:44:19,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (318 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr250REQUIRES_VIOLATIONMEMORY_DEREFERENCE (317 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (316 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (315 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr210REQUIRES_VIOLATIONMEMORY_DEREFERENCE (314 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE (313 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (312 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE (311 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE (310 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (309 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr244REQUIRES_VIOLATIONMEMORY_DEREFERENCE (308 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr230REQUIRES_VIOLATIONMEMORY_DEREFERENCE (307 of 563 remaining) [2023-08-26 18:44:19,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr463REQUIRES_VIOLATIONMEMORY_DEREFERENCE (306 of 563 remaining) [2023-08-26 18:44:19,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr403REQUIRES_VIOLATIONMEMORY_DEREFERENCE (305 of 563 remaining) [2023-08-26 18:44:19,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE (304 of 563 remaining) [2023-08-26 18:44:19,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr256REQUIRES_VIOLATIONMEMORY_DEREFERENCE (303 of 563 remaining) [2023-08-26 18:44:19,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (302 of 563 remaining) [2023-08-26 18:44:19,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr178REQUIRES_VIOLATIONMEMORY_DEREFERENCE (301 of 563 remaining) [2023-08-26 18:44:19,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE (300 of 563 remaining) [2023-08-26 18:44:19,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (299 of 563 remaining) [2023-08-26 18:44:19,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE (298 of 563 remaining) [2023-08-26 18:44:19,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (297 of 563 remaining) [2023-08-26 18:44:19,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr386REQUIRES_VIOLATIONMEMORY_DEREFERENCE (296 of 563 remaining) [2023-08-26 18:44:19,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr188REQUIRES_VIOLATIONMEMORY_DEREFERENCE (295 of 563 remaining) [2023-08-26 18:44:19,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (294 of 563 remaining) [2023-08-26 18:44:19,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (293 of 563 remaining) [2023-08-26 18:44:19,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE (292 of 563 remaining) [2023-08-26 18:44:19,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr365REQUIRES_VIOLATIONMEMORY_DEREFERENCE (291 of 563 remaining) [2023-08-26 18:44:19,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr429REQUIRES_VIOLATIONMEMORY_DEREFERENCE (290 of 563 remaining) [2023-08-26 18:44:19,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE (289 of 563 remaining) [2023-08-26 18:44:19,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE (288 of 563 remaining) [2023-08-26 18:44:19,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (287 of 563 remaining) [2023-08-26 18:44:19,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (286 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr270REQUIRES_VIOLATIONMEMORY_DEREFERENCE (285 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr383REQUIRES_VIOLATIONMEMORY_DEREFERENCE (284 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (283 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE (282 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE (281 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE (280 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE (279 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE (278 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr263REQUIRES_VIOLATIONMEMORY_DEREFERENCE (277 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (276 of 563 remaining) [2023-08-26 18:44:19,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE (275 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr470REQUIRES_VIOLATIONMEMORY_DEREFERENCE (274 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr179REQUIRES_VIOLATIONMEMORY_DEREFERENCE (273 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (272 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr409REQUIRES_VIOLATIONMEMORY_DEREFERENCE (271 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (270 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE (269 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr302REQUIRES_VIOLATIONMEMORY_DEREFERENCE (268 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr192REQUIRES_VIOLATIONMEMORY_DEREFERENCE (267 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr361REQUIRES_VIOLATIONMEMORY_DEREFERENCE (266 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE (265 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr353REQUIRES_VIOLATIONMEMORY_DEREFERENCE (264 of 563 remaining) [2023-08-26 18:44:19,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr237REQUIRES_VIOLATIONMEMORY_DEREFERENCE (263 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr184REQUIRES_VIOLATIONMEMORY_DEREFERENCE (262 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr238REQUIRES_VIOLATIONMEMORY_DEREFERENCE (261 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE (260 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr236REQUIRES_VIOLATIONMEMORY_DEREFERENCE (259 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (258 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE (257 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (256 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr268REQUIRES_VIOLATIONMEMORY_DEREFERENCE (255 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr352REQUIRES_VIOLATIONMEMORY_DEREFERENCE (254 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (253 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr391REQUIRES_VIOLATIONMEMORY_DEREFERENCE (252 of 563 remaining) [2023-08-26 18:44:19,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (251 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr417REQUIRES_VIOLATIONMEMORY_DEREFERENCE (250 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (249 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE (248 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE (247 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (246 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr276REQUIRES_VIOLATIONMEMORY_DEREFERENCE (245 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr224REQUIRES_VIOLATIONMEMORY_DEREFERENCE (244 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE (243 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE (242 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE (241 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE (240 of 563 remaining) [2023-08-26 18:44:19,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE (239 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (238 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (237 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (236 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (235 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr166REQUIRES_VIOLATIONMEMORY_DEREFERENCE (234 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (233 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr284REQUIRES_VIOLATIONMEMORY_DEREFERENCE (232 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE (231 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (230 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr171REQUIRES_VIOLATIONMEMORY_DEREFERENCE (229 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr366REQUIRES_VIOLATIONMEMORY_DEREFERENCE (228 of 563 remaining) [2023-08-26 18:44:19,722 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE (227 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE (226 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr466REQUIRES_VIOLATIONMEMORY_DEREFERENCE (225 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr347REQUIRES_VIOLATIONMEMORY_DEREFERENCE (224 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr423REQUIRES_VIOLATIONMEMORY_DEREFERENCE (223 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr248REQUIRES_VIOLATIONMEMORY_DEREFERENCE (222 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr264REQUIRES_VIOLATIONMEMORY_DEREFERENCE (221 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr226REQUIRES_VIOLATIONMEMORY_DEREFERENCE (220 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (219 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr170REQUIRES_VIOLATIONMEMORY_DEREFERENCE (218 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr271REQUIRES_VIOLATIONMEMORY_DEREFERENCE (217 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE (216 of 563 remaining) [2023-08-26 18:44:19,723 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr294REQUIRES_VIOLATIONMEMORY_DEREFERENCE (215 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (214 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr453REQUIRES_VIOLATIONMEMORY_DEREFERENCE (213 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE (212 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr187REQUIRES_VIOLATIONMEMORY_DEREFERENCE (211 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (210 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE (209 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr228REQUIRES_VIOLATIONMEMORY_DEREFERENCE (208 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr292REQUIRES_VIOLATIONMEMORY_DEREFERENCE (207 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr261REQUIRES_VIOLATIONMEMORY_DEREFERENCE (206 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (205 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE (204 of 563 remaining) [2023-08-26 18:44:19,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (203 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr265REQUIRES_VIOLATIONMEMORY_DEREFERENCE (202 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE (201 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr258REQUIRES_VIOLATIONMEMORY_DEREFERENCE (200 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (199 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (198 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE (197 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr329REQUIRES_VIOLATIONMEMORY_DEREFERENCE (196 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr273REQUIRES_VIOLATIONMEMORY_DEREFERENCE (195 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr195REQUIRES_VIOLATIONMEMORY_DEREFERENCE (194 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE (193 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr286REQUIRES_VIOLATIONMEMORY_DEREFERENCE (192 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr323REQUIRES_VIOLATIONMEMORY_DEREFERENCE (191 of 563 remaining) [2023-08-26 18:44:19,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr425REQUIRES_VIOLATIONMEMORY_DEREFERENCE (190 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (189 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (188 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (187 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr168REQUIRES_VIOLATIONMEMORY_DEREFERENCE (186 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (185 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr306REQUIRES_VIOLATIONMEMORY_DEREFERENCE (184 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr468REQUIRES_VIOLATIONMEMORY_DEREFERENCE (183 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE (182 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (181 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (180 of 563 remaining) [2023-08-26 18:44:19,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr177REQUIRES_VIOLATIONMEMORY_DEREFERENCE (179 of 563 remaining) [2023-08-26 18:44:19,727 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE (178 of 563 remaining) [2023-08-26 18:44:19,727 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE (177 of 563 remaining) [2023-08-26 18:44:19,727 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE (176 of 563 remaining) [2023-08-26 18:44:19,727 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (175 of 563 remaining) [2023-08-26 18:44:19,727 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE (174 of 563 remaining) [2023-08-26 18:44:19,727 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (173 of 563 remaining) [2023-08-26 18:44:19,727 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE (172 of 563 remaining) [2023-08-26 18:44:19,727 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (171 of 563 remaining) [2023-08-26 18:44:19,727 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (170 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE (169 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE (168 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr233REQUIRES_VIOLATIONMEMORY_DEREFERENCE (167 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr377REQUIRES_VIOLATIONMEMORY_DEREFERENCE (166 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (165 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (164 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE (163 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr259REQUIRES_VIOLATIONMEMORY_DEREFERENCE (162 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr215REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 563 remaining) [2023-08-26 18:44:19,728 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr435REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr231REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr211REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 563 remaining) [2023-08-26 18:44:19,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr253REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr172REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr379REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 563 remaining) [2023-08-26 18:44:19,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr249REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr186REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr281REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr412REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr395REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 563 remaining) [2023-08-26 18:44:19,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr445REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr444REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr197REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr193REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr219REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 563 remaining) [2023-08-26 18:44:19,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr169REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr266REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr345REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr243REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr190REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr227REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr456REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 563 remaining) [2023-08-26 18:44:19,733 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr351REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr413REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr433REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr176REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 563 remaining) [2023-08-26 18:44:19,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr344REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr280REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr325REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr310REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr173REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr290REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 563 remaining) [2023-08-26 18:44:19,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr406REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr203REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr198REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr385REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr454REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 563 remaining) [2023-08-26 18:44:19,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr399REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr254REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 563 remaining) [2023-08-26 18:44:19,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr181REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr405REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr189REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr380REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 563 remaining) [2023-08-26 18:44:19,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr174REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr272REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr288REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr207REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr279REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr229REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr452REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr411REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 563 remaining) [2023-08-26 18:44:19,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr167REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr430REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr194REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr464REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 563 remaining) [2023-08-26 18:44:19,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr339REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr183REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr469REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location StealerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 563 remaining) [2023-08-26 18:44:19,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 563 remaining) [2023-08-26 18:44:19,742 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:44:19,744 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-26 18:44:19,759 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:44:19,759 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:44:19,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:44:19 BasicIcfg [2023-08-26 18:44:19,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:44:19,764 INFO L158 Benchmark]: Toolchain (without parser) took 794764.85ms. Allocated memory was 346.0MB in the beginning and 10.3GB in the end (delta: 10.0GB). Free memory was 318.8MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 8.0GB. Max. memory is 16.0GB. [2023-08-26 18:44:19,764 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 346.0MB. Free memory is still 322.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:44:19,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1121.98ms. Allocated memory is still 346.0MB. Free memory was 318.8MB in the beginning and 301.2MB in the end (delta: 17.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.0GB. [2023-08-26 18:44:19,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.01ms. Allocated memory is still 346.0MB. Free memory was 301.0MB in the beginning and 290.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-26 18:44:19,764 INFO L158 Benchmark]: Boogie Preprocessor took 108.44ms. Allocated memory is still 346.0MB. Free memory was 290.8MB in the beginning and 282.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2023-08-26 18:44:19,764 INFO L158 Benchmark]: RCFGBuilder took 3003.72ms. Allocated memory was 346.0MB in the beginning and 429.9MB in the end (delta: 83.9MB). Free memory was 282.2MB in the beginning and 312.3MB in the end (delta: -30.2MB). Peak memory consumption was 129.7MB. Max. memory is 16.0GB. [2023-08-26 18:44:19,764 INFO L158 Benchmark]: TraceAbstraction took 790397.79ms. Allocated memory was 429.9MB in the beginning and 10.3GB in the end (delta: 9.9GB). Free memory was 311.3MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 7.9GB. Max. memory is 16.0GB. [2023-08-26 18:44:19,765 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 346.0MB. Free memory is still 322.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 1121.98ms. Allocated memory is still 346.0MB. Free memory was 318.8MB in the beginning and 301.2MB in the end (delta: 17.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 128.01ms. Allocated memory is still 346.0MB. Free memory was 301.0MB in the beginning and 290.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Preprocessor took 108.44ms. Allocated memory is still 346.0MB. Free memory was 290.8MB in the beginning and 282.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * RCFGBuilder took 3003.72ms. Allocated memory was 346.0MB in the beginning and 429.9MB in the end (delta: 83.9MB). Free memory was 282.2MB in the beginning and 312.3MB in the end (delta: -30.2MB). Peak memory consumption was 129.7MB. Max. memory is 16.0GB. * TraceAbstraction took 790397.79ms. Allocated memory was 429.9MB in the beginning and 10.3GB in the end (delta: 9.9GB). Free memory was 311.3MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 7.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 127]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [127] - GenericResultAtLocation [Line: 524]: Unsoundness Warning unspecified type, defaulting to int C: short [524] - GenericResultAtLocation [Line: 525]: Unsoundness Warning unspecified type, defaulting to int C: short [525] - GenericResultAtLocation [Line: 1797]: Unsoundness Warning unspecified type, defaulting to int C: long [1797] - GenericResultAtLocation [Line: 1798]: Unsoundness Warning unspecified type, defaulting to int C: long [1798] - GenericResultAtLocation [Line: 1799]: Unsoundness Warning unspecified type, defaulting to int C: long [1799] - GenericResultAtLocation [Line: 1800]: Unsoundness Warning unspecified type, defaulting to int C: long [1800] - GenericResultAtLocation [Line: 1802]: Unsoundness Warning unspecified type, defaulting to int C: long [1802] - GenericResultAtLocation [Line: 1805]: Unsoundness Warning unspecified type, defaulting to int C: long [1805] - GenericResultAtLocation [Line: 1805]: Unsoundness Warning unspecified type, defaulting to int C: long [1805] - GenericResultAtLocation [Line: 1805]: Unsoundness Warning unspecified type, defaulting to int C: long [1805] - GenericResultAtLocation [Line: 1807]: Unsoundness Warning unspecified type, defaulting to int C: long [1807] - GenericResultAtLocation [Line: 1812]: Unsoundness Warning unspecified type, defaulting to int C: long [1812] - GenericResultAtLocation [Line: 1812]: Unsoundness Warning unspecified type, defaulting to int C: long [1812] - GenericResultAtLocation [Line: 1812]: Unsoundness Warning unspecified type, defaulting to int C: long [1812] - GenericResultAtLocation [Line: 1825]: Unsoundness Warning unspecified type, defaulting to int C: long [1825] - GenericResultAtLocation [Line: 1825]: Unsoundness Warning unspecified type, defaulting to int C: long [1825] - GenericResultAtLocation [Line: 1826]: Unsoundness Warning unspecified type, defaulting to int C: long [1826] - GenericResultAtLocation [Line: 1830]: Unsoundness Warning unspecified type, defaulting to int C: long [1830] - GenericResultAtLocation [Line: 1830]: Unsoundness Warning unspecified type, defaulting to int C: long [1830] - GenericResultAtLocation [Line: 1833]: Unsoundness Warning unspecified type, defaulting to int C: long [1833] - GenericResultAtLocation [Line: 1845]: Unsoundness Warning unspecified type, defaulting to int C: long [1845] - GenericResultAtLocation [Line: 1848]: Unsoundness Warning unspecified type, defaulting to int C: long [1848] - GenericResultAtLocation [Line: 1861]: Unsoundness Warning unspecified type, defaulting to int C: long [1861] - GenericResultAtLocation [Line: 1864]: Unsoundness Warning unspecified type, defaulting to int C: long [1864] - GenericResultAtLocation [Line: 1880]: Unsoundness Warning unspecified type, defaulting to int C: long [1880] - GenericResultAtLocation [Line: 1883]: Unsoundness Warning unspecified type, defaulting to int C: long [1883] - GenericResultAtLocation [Line: 1893]: Unsoundness Warning unspecified type, defaulting to int C: long [1893] - GenericResultAtLocation [Line: 1894]: Unsoundness Warning unspecified type, defaulting to int C: long [1894] - GenericResultAtLocation [Line: 1899]: Unsoundness Warning unspecified type, defaulting to int C: long [1899] - GenericResultAtLocation [Line: 1902]: Unsoundness Warning unspecified type, defaulting to int C: long [1902] - GenericResultAtLocation [Line: 1904]: Unsoundness Warning unspecified type, defaulting to int C: long [1904] - GenericResultAtLocation [Line: 1915]: Unsoundness Warning unspecified type, defaulting to int C: long [1915] - GenericResultAtLocation [Line: 1916]: Unsoundness Warning unspecified type, defaulting to int C: long [1916] - GenericResultAtLocation [Line: 1922]: Unsoundness Warning unspecified type, defaulting to int C: long [1922] - GenericResultAtLocation [Line: 1926]: Unsoundness Warning unspecified type, defaulting to int C: long [1926] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 151.4s, 2054 PlacesBefore, 754 PlacesAfterwards, 2126 TransitionsBefore, 782 TransitionsAfterwards, 683760 CoEnabledTransitionPairs, 8 FixpointIterations, 123 TrivialSequentialCompositions, 2309 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 170 ConcurrentYvCompositions, 44 ChoiceCompositions, 2648 TotalNumberOfCompositions, 1720436 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 707998, independent: 700375, independent conditional: 0, independent unconditional: 700375, dependent: 7623, dependent conditional: 0, dependent unconditional: 7623, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 359318, independent: 357917, independent conditional: 0, independent unconditional: 357917, dependent: 1401, dependent conditional: 0, dependent unconditional: 1401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 707998, independent: 342458, independent conditional: 0, independent unconditional: 342458, dependent: 6222, dependent conditional: 0, dependent unconditional: 6222, unknown: 359318, unknown conditional: 0, unknown unconditional: 359318] , Statistics on independence cache: Total cache size (in pairs): 7563, Positive cache size: 6758, Positive conditional cache size: 0, Positive unconditional cache size: 6758, Negative cache size: 805, Negative conditional cache size: 0, Negative unconditional cache size: 805, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 2232 locations, 564 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: 790.1s, OverallIterations: 34, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 351.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 152.9s, HoareTripleCheckerStatistics: 46 mSolverCounterUnknown, 3242 SdHoareTripleChecker+Valid, 212.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3242 mSDsluCounter, 672 SdHoareTripleChecker+Invalid, 206.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 393 IncrementalHoareTripleChecker+Unchecked, 486 mSDsCounter, 408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20820 IncrementalHoareTripleChecker+Invalid, 21667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 408 mSolverCounterUnsat, 186 mSDtfsCounter, 20820 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 273 SyntacticMatches, 8 SemanticMatches, 521 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 5292 ImplicationChecksByTransitivity, 280.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8368occurred in iteration=31, InterpolantAutomatonStates: 315, 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.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 235.7s InterpolantComputationTime, 775 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 917 ConstructedInterpolants, 221 QuantifiedInterpolants, 68967 SizeOfPredicates, 396 NumberOfNonLiveVariables, 5966 ConjunctsInSsa, 855 ConjunctsInUnsatCore, 57 InterpolantComputations, 22 PerfectInterpolantSequences, 407/521 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 could not prove your program: Timeout Completed graceful shutdown