./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:38:03,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:38:03,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:38:03,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:38:03,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:38:03,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:38:03,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:38:03,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:38:03,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:38:03,177 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:38:03,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:38:03,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:38:03,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:38:03,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:38:03,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:38:03,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:38:03,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:38:03,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:38:03,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:38:03,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:38:03,179 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:38:03,180 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:38:03,181 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:38:03,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:38:03,182 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:38:03,182 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:38:03,182 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:38:03,182 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:38:03,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:38:03,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:38:03,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:38:03,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:38:03,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:38:03,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:38:03,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:38:03,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:38:03,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:38:03,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:38:03,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:38:03,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:38:03,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:38:03,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:38:03,186 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2024-11-19 09:38:03,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:38:03,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:38:03,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:38:03,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:38:03,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:38:03,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2024-11-19 09:38:04,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:38:04,811 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:38:04,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2024-11-19 09:38:04,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf189319/4c7c22c7da83413ebb4adefc38e87544/FLAG26195c343 [2024-11-19 09:38:04,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf189319/4c7c22c7da83413ebb4adefc38e87544 [2024-11-19 09:38:04,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:38:04,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:38:04,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:38:04,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:38:04,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:38:04,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:38:04" (1/1) ... [2024-11-19 09:38:04,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33857560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:04, skipping insertion in model container [2024-11-19 09:38:04,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:38:04" (1/1) ... [2024-11-19 09:38:04,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:38:05,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:38:05,354 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:38:05,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:38:05,437 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:38:05,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05 WrapperNode [2024-11-19 09:38:05,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:38:05,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:38:05,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:38:05,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:38:05,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,486 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 180 [2024-11-19 09:38:05,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:38:05,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:38:05,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:38:05,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:38:05,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,514 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2024-11-19 09:38:05,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:38:05,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:38:05,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:38:05,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:38:05,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (1/1) ... [2024-11-19 09:38:05,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:38:05,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:05,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:38:05,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:38:05,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:38:05,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:38:05,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:38:05,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 09:38:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 09:38:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 09:38:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:38:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:38:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:38:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:38:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:38:05,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:38:05,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:38:05,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:38:05,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:38:05,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:38:05,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:38:05,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:38:05,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:38:05,606 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 09:38:05,606 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 09:38:05,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:38:05,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:38:05,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:38:05,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:38:05,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:38:05,608 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:38:05,768 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:38:05,770 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:38:06,082 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:38:06,082 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:38:06,364 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:38:06,365 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 09:38:06,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:38:06 BoogieIcfgContainer [2024-11-19 09:38:06,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:38:06,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:38:06,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:38:06,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:38:06,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:38:04" (1/3) ... [2024-11-19 09:38:06,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d64b26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:38:06, skipping insertion in model container [2024-11-19 09:38:06,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:05" (2/3) ... [2024-11-19 09:38:06,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d64b26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:38:06, skipping insertion in model container [2024-11-19 09:38:06,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:38:06" (3/3) ... [2024-11-19 09:38:06,372 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2024-11-19 09:38:06,385 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:38:06,385 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-19 09:38:06,385 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:38:06,432 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:38:06,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 154 flow [2024-11-19 09:38:06,488 INFO L124 PetriNetUnfolderBase]: 3/74 cut-off events. [2024-11-19 09:38:06,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:06,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 74 events. 3/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 240 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-11-19 09:38:06,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 154 flow [2024-11-19 09:38:06,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 74 transitions, 151 flow [2024-11-19 09:38:06,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:38:06,506 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@74449816, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:38:06,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-19 09:38:06,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:38:06,509 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-19 09:38:06,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:06,510 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:06,510 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:38:06,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:06,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash 491635, now seen corresponding path program 1 times [2024-11-19 09:38:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421342515] [2024-11-19 09:38:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:06,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421342515] [2024-11-19 09:38:06,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421342515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:06,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:06,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239759647] [2024-11-19 09:38:06,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:06,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:06,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:06,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:06,864 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 75 [2024-11-19 09:38:06,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:06,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:06,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 75 [2024-11-19 09:38:06,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:07,045 INFO L124 PetriNetUnfolderBase]: 142/528 cut-off events. [2024-11-19 09:38:07,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:07,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 528 events. 142/528 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3259 event pairs, 99 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 797. Up to 246 conditions per place. [2024-11-19 09:38:07,052 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 37 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2024-11-19 09:38:07,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 245 flow [2024-11-19 09:38:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2024-11-19 09:38:07,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-19 09:38:07,064 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 151 flow. Second operand 3 states and 165 transitions. [2024-11-19 09:38:07,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 245 flow [2024-11-19 09:38:07,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:07,069 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 150 flow [2024-11-19 09:38:07,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2024-11-19 09:38:07,073 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2024-11-19 09:38:07,073 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 150 flow [2024-11-19 09:38:07,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:07,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:07,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:38:07,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:38:07,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:07,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash 491636, now seen corresponding path program 1 times [2024-11-19 09:38:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:07,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238617750] [2024-11-19 09:38:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:07,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238617750] [2024-11-19 09:38:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238617750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:07,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:07,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836399357] [2024-11-19 09:38:07,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:07,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:07,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:07,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:07,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:07,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 75 [2024-11-19 09:38:07,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:07,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:07,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 75 [2024-11-19 09:38:07,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:07,347 INFO L124 PetriNetUnfolderBase]: 132/496 cut-off events. [2024-11-19 09:38:07,347 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-19 09:38:07,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 496 events. 132/496 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3019 event pairs, 99 based on Foata normal form. 22/393 useless extension candidates. Maximal degree in co-relation 767. Up to 246 conditions per place. [2024-11-19 09:38:07,352 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 35 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2024-11-19 09:38:07,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 240 flow [2024-11-19 09:38:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2024-11-19 09:38:07,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7511111111111111 [2024-11-19 09:38:07,355 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 150 flow. Second operand 3 states and 169 transitions. [2024-11-19 09:38:07,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 240 flow [2024-11-19 09:38:07,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:07,356 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 142 flow [2024-11-19 09:38:07,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2024-11-19 09:38:07,357 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2024-11-19 09:38:07,358 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 142 flow [2024-11-19 09:38:07,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:07,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:07,361 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:38:07,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:38:07,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:07,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:07,362 INFO L85 PathProgramCache]: Analyzing trace with hash 472475573, now seen corresponding path program 1 times [2024-11-19 09:38:07,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:07,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963380742] [2024-11-19 09:38:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:07,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:07,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963380742] [2024-11-19 09:38:07,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963380742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:07,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:07,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:38:07,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510099557] [2024-11-19 09:38:07,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:07,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:38:07,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:07,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:38:07,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:38:07,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 75 [2024-11-19 09:38:07,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:07,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:07,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 75 [2024-11-19 09:38:07,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:07,711 INFO L124 PetriNetUnfolderBase]: 152/522 cut-off events. [2024-11-19 09:38:07,711 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-19 09:38:07,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 522 events. 152/522 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3105 event pairs, 126 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 834. Up to 307 conditions per place. [2024-11-19 09:38:07,714 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 31 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2024-11-19 09:38:07,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 198 flow [2024-11-19 09:38:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2024-11-19 09:38:07,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-11-19 09:38:07,716 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 142 flow. Second operand 3 states and 153 transitions. [2024-11-19 09:38:07,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 198 flow [2024-11-19 09:38:07,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:07,718 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 128 flow [2024-11-19 09:38:07,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2024-11-19 09:38:07,718 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2024-11-19 09:38:07,718 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 128 flow [2024-11-19 09:38:07,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:07,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:07,719 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:38:07,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:38:07,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:07,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:07,720 INFO L85 PathProgramCache]: Analyzing trace with hash 472475574, now seen corresponding path program 1 times [2024-11-19 09:38:07,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:07,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873781107] [2024-11-19 09:38:07,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:07,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:07,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:07,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873781107] [2024-11-19 09:38:07,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873781107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:07,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:07,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:38:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976963036] [2024-11-19 09:38:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:07,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:38:07,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:07,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:38:07,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:38:08,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2024-11-19 09:38:08,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:08,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:08,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2024-11-19 09:38:08,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:08,103 INFO L124 PetriNetUnfolderBase]: 152/525 cut-off events. [2024-11-19 09:38:08,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:08,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 525 events. 152/525 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3123 event pairs, 126 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 835. Up to 308 conditions per place. [2024-11-19 09:38:08,105 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 31 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2024-11-19 09:38:08,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 204 flow [2024-11-19 09:38:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:38:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:38:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2024-11-19 09:38:08,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59 [2024-11-19 09:38:08,107 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 128 flow. Second operand 4 states and 177 transitions. [2024-11-19 09:38:08,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 204 flow [2024-11-19 09:38:08,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:08,110 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 157 flow [2024-11-19 09:38:08,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-11-19 09:38:08,111 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2024-11-19 09:38:08,111 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 157 flow [2024-11-19 09:38:08,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:08,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:08,111 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1] [2024-11-19 09:38:08,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:38:08,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:08,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1776637570, now seen corresponding path program 1 times [2024-11-19 09:38:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839611762] [2024-11-19 09:38:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:08,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:08,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839611762] [2024-11-19 09:38:08,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839611762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:38:08,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770445735] [2024-11-19 09:38:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:08,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:08,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:08,353 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) [2024-11-19 09:38:08,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:38:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:08,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 09:38:08,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:08,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:08,539 INFO L378 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 14 treesize of output 9 [2024-11-19 09:38:08,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:08,604 INFO L378 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 14 treesize of output 9 [2024-11-19 09:38:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:08,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:38:08,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:38:08,754 INFO L378 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 43 treesize of output 61 [2024-11-19 09:38:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:08,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770445735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:38:08,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:38:08,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-19 09:38:08,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521271346] [2024-11-19 09:38:08,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:38:08,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 09:38:08,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:08,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 09:38:08,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:38:09,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-11-19 09:38:09,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 157 flow. Second operand has 15 states, 15 states have (on average 35.4) internal successors, (531), 15 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:09,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:09,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-11-19 09:38:09,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:10,317 INFO L124 PetriNetUnfolderBase]: 174/590 cut-off events. [2024-11-19 09:38:10,320 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 09:38:10,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 590 events. 174/590 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3517 event pairs, 30 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 979. Up to 188 conditions per place. [2024-11-19 09:38:10,323 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 59 selfloop transitions, 11 changer transitions 0/99 dead transitions. [2024-11-19 09:38:10,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 391 flow [2024-11-19 09:38:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:38:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:38:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 313 transitions. [2024-11-19 09:38:10,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5961904761904762 [2024-11-19 09:38:10,325 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 157 flow. Second operand 7 states and 313 transitions. [2024-11-19 09:38:10,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 391 flow [2024-11-19 09:38:10,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:10,326 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 229 flow [2024-11-19 09:38:10,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2024-11-19 09:38:10,328 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2024-11-19 09:38:10,329 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 229 flow [2024-11-19 09:38:10,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 35.4) internal successors, (531), 15 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:10,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:10,329 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:10,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:10,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:10,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:10,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2107518822, now seen corresponding path program 1 times [2024-11-19 09:38:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:10,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141760429] [2024-11-19 09:38:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:10,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 09:38:10,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141760429] [2024-11-19 09:38:10,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141760429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:10,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:10,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:38:10,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006322785] [2024-11-19 09:38:10,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:10,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:10,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:10,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:10,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:10,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 75 [2024-11-19 09:38:10,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:10,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:10,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 75 [2024-11-19 09:38:10,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:10,727 INFO L124 PetriNetUnfolderBase]: 254/916 cut-off events. [2024-11-19 09:38:10,727 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-19 09:38:10,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 916 events. 254/916 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5557 event pairs, 153 based on Foata normal form. 10/742 useless extension candidates. Maximal degree in co-relation 1597. Up to 300 conditions per place. [2024-11-19 09:38:10,731 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 53 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2024-11-19 09:38:10,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 91 transitions, 393 flow [2024-11-19 09:38:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2024-11-19 09:38:10,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8488888888888889 [2024-11-19 09:38:10,733 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 229 flow. Second operand 3 states and 191 transitions. [2024-11-19 09:38:10,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 91 transitions, 393 flow [2024-11-19 09:38:10,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 385 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:10,738 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 248 flow [2024-11-19 09:38:10,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2024-11-19 09:38:10,739 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2024-11-19 09:38:10,739 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 248 flow [2024-11-19 09:38:10,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:10,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:10,740 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:10,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:38:10,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:10,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:10,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1944262240, now seen corresponding path program 1 times [2024-11-19 09:38:10,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:10,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339652103] [2024-11-19 09:38:10,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:10,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339652103] [2024-11-19 09:38:10,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339652103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:38:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602298618] [2024-11-19 09:38:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:10,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:10,816 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) [2024-11-19 09:38:10,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:38:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:10,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:38:10,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:10,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:38:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:10,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602298618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:38:10,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:38:10,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-19 09:38:10,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719012313] [2024-11-19 09:38:10,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:38:10,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:38:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:10,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:38:10,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:38:10,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2024-11-19 09:38:10,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 248 flow. Second operand has 9 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:10,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:10,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2024-11-19 09:38:10,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:11,440 INFO L124 PetriNetUnfolderBase]: 702/2307 cut-off events. [2024-11-19 09:38:11,440 INFO L125 PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES. [2024-11-19 09:38:11,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4077 conditions, 2307 events. 702/2307 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 13148 event pairs, 27 based on Foata normal form. 50/1982 useless extension candidates. Maximal degree in co-relation 4061. Up to 234 conditions per place. [2024-11-19 09:38:11,450 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 146 selfloop transitions, 16 changer transitions 0/193 dead transitions. [2024-11-19 09:38:11,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 193 transitions, 869 flow [2024-11-19 09:38:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:38:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:38:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 531 transitions. [2024-11-19 09:38:11,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.885 [2024-11-19 09:38:11,452 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 248 flow. Second operand 8 states and 531 transitions. [2024-11-19 09:38:11,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 193 transitions, 869 flow [2024-11-19 09:38:11,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 193 transitions, 863 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:11,456 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 350 flow [2024-11-19 09:38:11,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=350, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2024-11-19 09:38:11,457 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 15 predicate places. [2024-11-19 09:38:11,457 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 350 flow [2024-11-19 09:38:11,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:11,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:11,458 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 1, 1] [2024-11-19 09:38:11,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:38:11,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-19 09:38:11,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:11,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash 814847702, now seen corresponding path program 2 times [2024-11-19 09:38:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744445656] [2024-11-19 09:38:11,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:38:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:11,726 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:38:11,727 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:38:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:12,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744445656] [2024-11-19 09:38:12,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744445656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:38:12,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118634724] [2024-11-19 09:38:12,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:38:12,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:12,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:12,371 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) [2024-11-19 09:38:12,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:38:12,508 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:38:12,508 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:38:12,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 09:38:12,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:12,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:12,547 INFO L378 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 14 treesize of output 9 [2024-11-19 09:38:12,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:12,612 INFO L378 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 14 treesize of output 9 [2024-11-19 09:38:12,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:12,682 INFO L378 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 14 treesize of output 9 [2024-11-19 09:38:12,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:12,758 INFO L378 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 14 treesize of output 9 [2024-11-19 09:38:12,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:12,822 INFO L378 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 14 treesize of output 9 [2024-11-19 09:38:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:12,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:38:12,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:38:12,957 INFO L378 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 43 treesize of output 61 [2024-11-19 09:38:13,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:38:13,093 INFO L378 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 43 treesize of output 61 [2024-11-19 09:38:13,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:38:13,231 INFO L378 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 43 treesize of output 61 [2024-11-19 09:38:13,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:38:13,350 INFO L378 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 43 treesize of output 61 [2024-11-19 09:38:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118634724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:38:13,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:38:13,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2024-11-19 09:38:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118670457] [2024-11-19 09:38:13,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:38:13,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 09:38:13,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:13,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 09:38:13,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 09:38:18,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-11-19 09:38:18,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 350 flow. Second operand has 33 states, 33 states have (on average 35.45454545454545) internal successors, (1170), 33 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:18,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:18,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-11-19 09:38:18,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:19,439 INFO L124 PetriNetUnfolderBase]: 806/2516 cut-off events. [2024-11-19 09:38:19,439 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2024-11-19 09:38:19,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4960 conditions, 2516 events. 806/2516 cut-off events. For 796/796 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 14618 event pairs, 0 based on Foata normal form. 6/2127 useless extension candidates. Maximal degree in co-relation 4937. Up to 855 conditions per place. [2024-11-19 09:38:19,450 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 93 selfloop transitions, 26 changer transitions 0/149 dead transitions. [2024-11-19 09:38:19,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 149 transitions, 930 flow [2024-11-19 09:38:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:38:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-19 09:38:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 596 transitions. [2024-11-19 09:38:19,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5676190476190476 [2024-11-19 09:38:19,452 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 350 flow. Second operand 14 states and 596 transitions. [2024-11-19 09:38:19,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 149 transitions, 930 flow [2024-11-19 09:38:19,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 149 transitions, 912 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:19,458 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 525 flow [2024-11-19 09:38:19,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=525, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2024-11-19 09:38:19,460 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 35 predicate places. [2024-11-19 09:38:19,460 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 525 flow [2024-11-19 09:38:19,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 35.45454545454545) internal successors, (1170), 33 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:19,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:19,461 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:19,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 09:38:19,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:19,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:19,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1576258752, now seen corresponding path program 2 times [2024-11-19 09:38:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:19,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091781424] [2024-11-19 09:38:19,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:38:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:19,685 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:38:19,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:38:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 09:38:19,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:19,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091781424] [2024-11-19 09:38:19,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091781424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:19,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:19,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:19,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589871157] [2024-11-19 09:38:19,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:19,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:19,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:19,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 75 [2024-11-19 09:38:19,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:19,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:19,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 75 [2024-11-19 09:38:19,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:20,035 INFO L124 PetriNetUnfolderBase]: 685/2488 cut-off events. [2024-11-19 09:38:20,035 INFO L125 PetriNetUnfolderBase]: For 1467/1467 co-relation queries the response was YES. [2024-11-19 09:38:20,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4897 conditions, 2488 events. 685/2488 cut-off events. For 1467/1467 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 15149 event pairs, 504 based on Foata normal form. 68/2129 useless extension candidates. Maximal degree in co-relation 4865. Up to 1260 conditions per place. [2024-11-19 09:38:20,048 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 75 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2024-11-19 09:38:20,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 831 flow [2024-11-19 09:38:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2024-11-19 09:38:20,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7822222222222223 [2024-11-19 09:38:20,049 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 525 flow. Second operand 3 states and 176 transitions. [2024-11-19 09:38:20,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 831 flow [2024-11-19 09:38:20,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 108 transitions, 781 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-19 09:38:20,054 INFO L231 Difference]: Finished difference. Result has 105 places, 86 transitions, 482 flow [2024-11-19 09:38:20,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=105, PETRI_TRANSITIONS=86} [2024-11-19 09:38:20,056 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 30 predicate places. [2024-11-19 09:38:20,056 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 86 transitions, 482 flow [2024-11-19 09:38:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:20,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:20,056 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:20,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:38:20,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:20,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1576258753, now seen corresponding path program 1 times [2024-11-19 09:38:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848015853] [2024-11-19 09:38:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 09:38:20,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:20,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848015853] [2024-11-19 09:38:20,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848015853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:20,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:20,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:20,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005999069] [2024-11-19 09:38:20,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:20,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:20,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:20,204 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 75 [2024-11-19 09:38:20,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 86 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:20,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:20,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 75 [2024-11-19 09:38:20,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:20,473 INFO L124 PetriNetUnfolderBase]: 752/2419 cut-off events. [2024-11-19 09:38:20,474 INFO L125 PetriNetUnfolderBase]: For 1435/1435 co-relation queries the response was YES. [2024-11-19 09:38:20,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5089 conditions, 2419 events. 752/2419 cut-off events. For 1435/1435 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 13983 event pairs, 504 based on Foata normal form. 68/2128 useless extension candidates. Maximal degree in co-relation 5057. Up to 1260 conditions per place. [2024-11-19 09:38:20,483 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 76 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2024-11-19 09:38:20,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 106 transitions, 783 flow [2024-11-19 09:38:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2024-11-19 09:38:20,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2024-11-19 09:38:20,484 INFO L175 Difference]: Start difference. First operand has 105 places, 86 transitions, 482 flow. Second operand 3 states and 174 transitions. [2024-11-19 09:38:20,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 106 transitions, 783 flow [2024-11-19 09:38:20,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 106 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:20,489 INFO L231 Difference]: Finished difference. Result has 103 places, 84 transitions, 478 flow [2024-11-19 09:38:20,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=103, PETRI_TRANSITIONS=84} [2024-11-19 09:38:20,490 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 28 predicate places. [2024-11-19 09:38:20,490 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 84 transitions, 478 flow [2024-11-19 09:38:20,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:20,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:20,491 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:20,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:38:20,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:20,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1338809728, now seen corresponding path program 1 times [2024-11-19 09:38:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733343092] [2024-11-19 09:38:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:20,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:20,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:20,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733343092] [2024-11-19 09:38:20,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733343092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:38:20,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804325132] [2024-11-19 09:38:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:20,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:20,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:20,685 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) [2024-11-19 09:38:20,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:38:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:20,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:38:20,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:20,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:38:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:20,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804325132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:38:20,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:38:20,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-19 09:38:20,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504497100] [2024-11-19 09:38:20,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:38:20,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:38:20,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:20,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:38:20,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:38:21,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2024-11-19 09:38:21,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 84 transitions, 478 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:21,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:21,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2024-11-19 09:38:21,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:21,686 INFO L124 PetriNetUnfolderBase]: 1142/3757 cut-off events. [2024-11-19 09:38:21,686 INFO L125 PetriNetUnfolderBase]: For 2013/2013 co-relation queries the response was YES. [2024-11-19 09:38:21,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7421 conditions, 3757 events. 1142/3757 cut-off events. For 2013/2013 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 21475 event pairs, 27 based on Foata normal form. 44/3193 useless extension candidates. Maximal degree in co-relation 7389. Up to 235 conditions per place. [2024-11-19 09:38:21,701 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 234 selfloop transitions, 25 changer transitions 0/286 dead transitions. [2024-11-19 09:38:21,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 286 transitions, 1603 flow [2024-11-19 09:38:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:38:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:38:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 806 transitions. [2024-11-19 09:38:21,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8955555555555555 [2024-11-19 09:38:21,703 INFO L175 Difference]: Start difference. First operand has 103 places, 84 transitions, 478 flow. Second operand 12 states and 806 transitions. [2024-11-19 09:38:21,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 286 transitions, 1603 flow [2024-11-19 09:38:21,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 286 transitions, 1557 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:21,711 INFO L231 Difference]: Finished difference. Result has 117 places, 86 transitions, 592 flow [2024-11-19 09:38:21,712 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=592, PETRI_PLACES=117, PETRI_TRANSITIONS=86} [2024-11-19 09:38:21,712 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 42 predicate places. [2024-11-19 09:38:21,712 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 86 transitions, 592 flow [2024-11-19 09:38:21,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:21,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:21,713 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 1, 1] [2024-11-19 09:38:21,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 09:38:21,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:21,916 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:21,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1416734086, now seen corresponding path program 3 times [2024-11-19 09:38:21,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:21,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589978780] [2024-11-19 09:38:21,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:38:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:22,066 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 09:38:22,066 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:38:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 183 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:22,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589978780] [2024-11-19 09:38:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589978780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:38:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107617962] [2024-11-19 09:38:22,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:38:22,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:22,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:22,320 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) [2024-11-19 09:38:22,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:38:44,170 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 09:38:44,170 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:38:44,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:38:44,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:44,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:44,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107617962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:44,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:38:44,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2024-11-19 09:38:44,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331891376] [2024-11-19 09:38:44,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:44,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:38:44,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:44,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:38:44,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:38:44,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2024-11-19 09:38:44,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 86 transitions, 592 flow. Second operand has 13 states, 13 states have (on average 47.53846153846154) internal successors, (618), 13 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:44,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:44,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2024-11-19 09:38:44,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:45,027 INFO L124 PetriNetUnfolderBase]: 1131/3742 cut-off events. [2024-11-19 09:38:45,027 INFO L125 PetriNetUnfolderBase]: For 2240/2240 co-relation queries the response was YES. [2024-11-19 09:38:45,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7382 conditions, 3742 events. 1131/3742 cut-off events. For 2240/2240 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 21465 event pairs, 18 based on Foata normal form. 11/3145 useless extension candidates. Maximal degree in co-relation 7344. Up to 228 conditions per place. [2024-11-19 09:38:45,040 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 242 selfloop transitions, 23 changer transitions 1/292 dead transitions. [2024-11-19 09:38:45,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 292 transitions, 1639 flow [2024-11-19 09:38:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:38:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 09:38:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 853 transitions. [2024-11-19 09:38:45,042 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8748717948717949 [2024-11-19 09:38:45,042 INFO L175 Difference]: Start difference. First operand has 117 places, 86 transitions, 592 flow. Second operand 13 states and 853 transitions. [2024-11-19 09:38:45,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 292 transitions, 1639 flow [2024-11-19 09:38:45,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 292 transitions, 1537 flow, removed 0 selfloop flow, removed 15 redundant places. [2024-11-19 09:38:45,050 INFO L231 Difference]: Finished difference. Result has 113 places, 82 transitions, 503 flow [2024-11-19 09:38:45,050 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=503, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2024-11-19 09:38:45,050 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 38 predicate places. [2024-11-19 09:38:45,051 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 82 transitions, 503 flow [2024-11-19 09:38:45,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 47.53846153846154) internal successors, (618), 13 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:45,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:45,051 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:45,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:45,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 09:38:45,252 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:45,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:45,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1031553632, now seen corresponding path program 2 times [2024-11-19 09:38:45,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:45,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210658844] [2024-11-19 09:38:45,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:38:45,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:45,321 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:38:45,325 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:38:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:45,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210658844] [2024-11-19 09:38:45,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210658844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:38:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867448434] [2024-11-19 09:38:45,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:38:45,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:45,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:45,770 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) [2024-11-19 09:38:45,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 09:38:45,983 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:38:45,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:38:45,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 09:38:45,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:46,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:46,129 INFO L378 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 16 treesize of output 11 [2024-11-19 09:38:46,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:38:46,135 INFO L378 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 [2024-11-19 09:38:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:46,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:38:46,292 INFO L378 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 52 treesize of output 48 [2024-11-19 09:38:46,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:38:46,304 INFO L378 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 46 treesize of output 64 [2024-11-19 09:38:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867448434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:38:46,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:38:46,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2024-11-19 09:38:46,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26516891] [2024-11-19 09:38:46,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:38:46,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 09:38:46,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:46,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 09:38:46,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2024-11-19 09:38:47,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 75 [2024-11-19 09:38:47,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 82 transitions, 503 flow. Second operand has 31 states, 31 states have (on average 40.67741935483871) internal successors, (1261), 31 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:47,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:47,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 75 [2024-11-19 09:38:47,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:50,445 INFO L124 PetriNetUnfolderBase]: 2713/8822 cut-off events. [2024-11-19 09:38:50,445 INFO L125 PetriNetUnfolderBase]: For 4214/4214 co-relation queries the response was YES. [2024-11-19 09:38:50,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16600 conditions, 8822 events. 2713/8822 cut-off events. For 4214/4214 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 65773 event pairs, 98 based on Foata normal form. 114/7394 useless extension candidates. Maximal degree in co-relation 16571. Up to 342 conditions per place. [2024-11-19 09:38:50,474 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 627 selfloop transitions, 120 changer transitions 2/775 dead transitions. [2024-11-19 09:38:50,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 775 transitions, 3931 flow [2024-11-19 09:38:50,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-19 09:38:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-19 09:38:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2530 transitions. [2024-11-19 09:38:50,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-19 09:38:50,482 INFO L175 Difference]: Start difference. First operand has 113 places, 82 transitions, 503 flow. Second operand 46 states and 2530 transitions. [2024-11-19 09:38:50,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 775 transitions, 3931 flow [2024-11-19 09:38:50,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 775 transitions, 3813 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-19 09:38:50,496 INFO L231 Difference]: Finished difference. Result has 190 places, 179 transitions, 1487 flow [2024-11-19 09:38:50,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1487, PETRI_PLACES=190, PETRI_TRANSITIONS=179} [2024-11-19 09:38:50,498 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 115 predicate places. [2024-11-19 09:38:50,498 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 179 transitions, 1487 flow [2024-11-19 09:38:50,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 40.67741935483871) internal successors, (1261), 31 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:50,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:50,499 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:50,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:50,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:50,700 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:50,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 405566001, now seen corresponding path program 1 times [2024-11-19 09:38:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69515584] [2024-11-19 09:38:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:51,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:51,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69515584] [2024-11-19 09:38:51,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69515584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:38:51,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419544374] [2024-11-19 09:38:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:51,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:51,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:51,215 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) [2024-11-19 09:38:51,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 09:38:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:51,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 09:38:51,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:51,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:51,579 INFO L378 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 16 treesize of output 11 [2024-11-19 09:38:51,583 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:38:51,583 INFO L378 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 [2024-11-19 09:38:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:51,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:38:51,695 INFO L378 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 52 treesize of output 48 [2024-11-19 09:38:51,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:38:51,721 INFO L378 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 46 treesize of output 64 [2024-11-19 09:38:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:51,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419544374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:38:51,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:38:51,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 27 [2024-11-19 09:38:51,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834570666] [2024-11-19 09:38:51,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:38:51,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 09:38:51,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:51,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 09:38:51,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2024-11-19 09:38:52,800 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-11-19 09:38:52,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 179 transitions, 1487 flow. Second operand has 29 states, 29 states have (on average 36.758620689655174) internal successors, (1066), 29 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:52,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:52,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-11-19 09:38:52,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:54,961 INFO L124 PetriNetUnfolderBase]: 2784/8809 cut-off events. [2024-11-19 09:38:54,961 INFO L125 PetriNetUnfolderBase]: For 72229/72340 co-relation queries the response was YES. [2024-11-19 09:38:54,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29330 conditions, 8809 events. 2784/8809 cut-off events. For 72229/72340 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 65037 event pairs, 318 based on Foata normal form. 46/7398 useless extension candidates. Maximal degree in co-relation 29257. Up to 671 conditions per place. [2024-11-19 09:38:55,016 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 425 selfloop transitions, 83 changer transitions 1/535 dead transitions. [2024-11-19 09:38:55,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 535 transitions, 5373 flow [2024-11-19 09:38:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 09:38:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-19 09:38:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1104 transitions. [2024-11-19 09:38:55,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6690909090909091 [2024-11-19 09:38:55,022 INFO L175 Difference]: Start difference. First operand has 190 places, 179 transitions, 1487 flow. Second operand 22 states and 1104 transitions. [2024-11-19 09:38:55,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 535 transitions, 5373 flow [2024-11-19 09:38:55,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 535 transitions, 5282 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-11-19 09:38:55,102 INFO L231 Difference]: Finished difference. Result has 203 places, 202 transitions, 1700 flow [2024-11-19 09:38:55,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1700, PETRI_PLACES=203, PETRI_TRANSITIONS=202} [2024-11-19 09:38:55,103 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 128 predicate places. [2024-11-19 09:38:55,103 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 202 transitions, 1700 flow [2024-11-19 09:38:55,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 36.758620689655174) internal successors, (1066), 29 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:55,104 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:55,104 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:55,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 09:38:55,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:55,304 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:55,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:55,305 INFO L85 PathProgramCache]: Analyzing trace with hash -312355317, now seen corresponding path program 1 times [2024-11-19 09:38:55,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:55,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708126944] [2024-11-19 09:38:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:55,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 101 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708126944] [2024-11-19 09:38:58,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708126944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:38:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311670806] [2024-11-19 09:38:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:58,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:58,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:58,602 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) [2024-11-19 09:38:58,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 09:38:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:58,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-19 09:38:58,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:58,871 INFO L378 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 [2024-11-19 09:38:58,886 INFO L378 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 15 treesize of output 1 [2024-11-19 09:38:58,898 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-11-19 09:38:58,898 INFO L378 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 21 treesize of output 29 [2024-11-19 09:38:58,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:58,938 INFO L378 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 37 treesize of output 17 [2024-11-19 09:38:58,980 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-19 09:38:58,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-19 09:38:59,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:59,022 INFO L378 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 37 treesize of output 17 [2024-11-19 09:38:59,072 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-19 09:38:59,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-19 09:38:59,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:59,113 INFO L378 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 37 treesize of output 17 [2024-11-19 09:38:59,150 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-19 09:38:59,150 INFO L378 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 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-19 09:38:59,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:59,200 INFO L378 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 37 treesize of output 17 [2024-11-19 09:38:59,240 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-19 09:38:59,241 INFO L378 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 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-19 09:38:59,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:59,297 INFO L378 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 37 treesize of output 17 [2024-11-19 09:38:59,336 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-19 09:38:59,339 INFO L378 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 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-19 09:38:59,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:59,383 INFO L378 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 37 treesize of output 17 [2024-11-19 09:38:59,424 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-19 09:38:59,424 INFO L378 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 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-19 09:38:59,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:59,471 INFO L378 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 37 treesize of output 17 [2024-11-19 09:38:59,521 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-19 09:38:59,521 INFO L378 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 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-19 09:38:59,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:59,576 INFO L378 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 37 treesize of output 17 [2024-11-19 09:38:59,630 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-19 09:38:59,630 INFO L378 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 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-19 09:38:59,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:38:59,685 INFO L378 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 37 treesize of output 17 [2024-11-19 09:38:59,777 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-19 09:38:59,777 INFO L378 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 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-19 09:38:59,823 INFO L378 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 25 treesize of output 13 [2024-11-19 09:38:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:59,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:39:07,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_86| Int) (|v_ULTIMATE.start_main_~j~0#1_202| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int)) (or (= (select |c_#valid| (select (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_202| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_86|) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_202| (+ |c_ULTIMATE.start_main_~j~0#1| 1)))) is different from false [2024-11-19 09:39:10,174 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_86| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| Int) (|v_ULTIMATE.start_main_~j~0#1_203| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_~j~0#1_202| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_203| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_88|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_202| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_86|) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_203| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_202| (+ |v_ULTIMATE.start_main_~j~0#1_203| 1)))) is different from false [2024-11-19 09:39:11,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_86| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_main_~j~0#1_203| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_~j~0#1_202| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int)) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_203| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_88|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_202| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_86|) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_203| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_202| (+ |v_ULTIMATE.start_main_~j~0#1_203| 1)))) is different from false [2024-11-19 09:39:13,143 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_86| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_main_~j~0#1_203| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_~j~0#1_202| Int) (|v_ULTIMATE.start_main_~j~0#1_204| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_90| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int)) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_204| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_90|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_203| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_88|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_202| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_86|) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_203| (+ |v_ULTIMATE.start_main_~j~0#1_204| 1)) (< |v_ULTIMATE.start_main_~j~0#1_204| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_202| (+ |v_ULTIMATE.start_main_~j~0#1_203| 1)))) is different from false [2024-11-19 09:39:14,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_86| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| Int) (|v_ULTIMATE.start_new_~p~0#1.base_115| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_main_~j~0#1_203| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_~j~0#1_202| Int) (|v_ULTIMATE.start_main_~j~0#1_204| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_90| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int)) (or (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_115| 1) |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_204| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_90|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_203| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_88|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_202| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_86|) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_203| (+ |v_ULTIMATE.start_main_~j~0#1_204| 1)) (< |v_ULTIMATE.start_main_~j~0#1_204| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_202| (+ |v_ULTIMATE.start_main_~j~0#1_203| 1)))) is different from false [2024-11-19 09:39:16,221 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_86| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_90| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_115| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_main_~j~0#1_203| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_~j~0#1_202| Int) (|v_ULTIMATE.start_main_~j~0#1_205| Int) (|v_ULTIMATE.start_main_~j~0#1_204| Int)) (or (= 1 (select (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_115| 1) |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_205| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_92|) (+ (* |v_ULTIMATE.start_main_~j~0#1_204| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_90|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_203| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_88|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_202| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_86|) |c_~#slot~0.offset|))) (< |v_ULTIMATE.start_main_~j~0#1_203| (+ |v_ULTIMATE.start_main_~j~0#1_204| 1)) (< |v_ULTIMATE.start_main_~j~0#1_202| (+ |v_ULTIMATE.start_main_~j~0#1_203| 1)) (< |v_ULTIMATE.start_main_~j~0#1_205| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_204| (+ |v_ULTIMATE.start_main_~j~0#1_205| 1)))) is different from false [2024-11-19 09:39:17,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_86| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_90| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_116| Int) (|v_ULTIMATE.start_new_~p~0#1.base_115| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_main_~j~0#1_203| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_~j~0#1_202| Int) (|v_ULTIMATE.start_main_~j~0#1_205| Int) (|v_ULTIMATE.start_main_~j~0#1_204| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_203| (+ |v_ULTIMATE.start_main_~j~0#1_204| 1)) (< |v_ULTIMATE.start_main_~j~0#1_202| (+ |v_ULTIMATE.start_main_~j~0#1_203| 1)) (< |v_ULTIMATE.start_main_~j~0#1_205| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_204| (+ |v_ULTIMATE.start_main_~j~0#1_205| 1)) (= (select (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_116| 1) |v_ULTIMATE.start_new_~p~0#1.base_115| 1) |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_205| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_92|) (+ (* |v_ULTIMATE.start_main_~j~0#1_204| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_90|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_203| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_88|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_202| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_86|) |c_~#slot~0.offset|)) 1))) is different from false [2024-11-19 09:39:19,774 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_86| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_90| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_92| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_94| Int) (|v_ULTIMATE.start_new_~p~0#1.base_116| Int) (|v_ULTIMATE.start_new_~p~0#1.base_115| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_main_~j~0#1_203| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_~j~0#1_202| Int) (|v_ULTIMATE.start_main_~j~0#1_205| Int) (|v_ULTIMATE.start_main_~j~0#1_204| Int) (|v_ULTIMATE.start_main_~j~0#1_206| Int)) (or (= (select (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_116| 1) |v_ULTIMATE.start_new_~p~0#1.base_115| 1) |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_206| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_94|) (+ (* |v_ULTIMATE.start_main_~j~0#1_205| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_92|) (+ (* |v_ULTIMATE.start_main_~j~0#1_204| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_90|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_203| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_88|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_202| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_86|) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_205| (+ |v_ULTIMATE.start_main_~j~0#1_206| 1)) (< |v_ULTIMATE.start_main_~j~0#1_203| (+ |v_ULTIMATE.start_main_~j~0#1_204| 1)) (< |v_ULTIMATE.start_main_~j~0#1_202| (+ |v_ULTIMATE.start_main_~j~0#1_203| 1)) (< |v_ULTIMATE.start_main_~j~0#1_206| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_204| (+ |v_ULTIMATE.start_main_~j~0#1_205| 1)))) is different from false [2024-11-19 09:39:21,666 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_86| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_90| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_92| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_94| Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (|v_ULTIMATE.start_new_~p~0#1.base_116| Int) (|v_ULTIMATE.start_new_~p~0#1.base_115| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_main_~j~0#1_203| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_~j~0#1_202| Int) (|v_ULTIMATE.start_main_~j~0#1_205| Int) (|v_ULTIMATE.start_main_~j~0#1_204| Int) (|v_ULTIMATE.start_main_~j~0#1_206| Int)) (or (= (select (store (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_117| 1) |v_ULTIMATE.start_new_~p~0#1.base_116| 1) |v_ULTIMATE.start_new_~p~0#1.base_115| 1) |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_206| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_94|) (+ (* |v_ULTIMATE.start_main_~j~0#1_205| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_92|) (+ (* |v_ULTIMATE.start_main_~j~0#1_204| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_90|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_203| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_88|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_202| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_86|) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_205| (+ |v_ULTIMATE.start_main_~j~0#1_206| 1)) (< |v_ULTIMATE.start_main_~j~0#1_203| (+ |v_ULTIMATE.start_main_~j~0#1_204| 1)) (< |v_ULTIMATE.start_main_~j~0#1_202| (+ |v_ULTIMATE.start_main_~j~0#1_203| 1)) (< |v_ULTIMATE.start_main_~j~0#1_206| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_204| (+ |v_ULTIMATE.start_main_~j~0#1_205| 1)))) is different from false [2024-11-19 09:39:23,509 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_86| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_96| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_90| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_92| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_94| Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (|v_ULTIMATE.start_new_~p~0#1.base_116| Int) (|v_ULTIMATE.start_new_~p~0#1.base_115| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_main_~j~0#1_203| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_~j~0#1_202| Int) (|v_ULTIMATE.start_main_~j~0#1_205| Int) (|v_ULTIMATE.start_main_~j~0#1_204| Int) (|v_ULTIMATE.start_main_~j~0#1_207| Int) (|v_ULTIMATE.start_main_~j~0#1_206| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_207| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_206| (+ |v_ULTIMATE.start_main_~j~0#1_207| 1)) (< |v_ULTIMATE.start_main_~j~0#1_205| (+ |v_ULTIMATE.start_main_~j~0#1_206| 1)) (< |v_ULTIMATE.start_main_~j~0#1_203| (+ |v_ULTIMATE.start_main_~j~0#1_204| 1)) (< |v_ULTIMATE.start_main_~j~0#1_202| (+ |v_ULTIMATE.start_main_~j~0#1_203| 1)) (= (select (store (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_117| 1) |v_ULTIMATE.start_new_~p~0#1.base_116| 1) |v_ULTIMATE.start_new_~p~0#1.base_115| 1) |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_207| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_96|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_206| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_94|) (+ (* |v_ULTIMATE.start_main_~j~0#1_205| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_92|) (+ (* |v_ULTIMATE.start_main_~j~0#1_204| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_90|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_203| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_88|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_202| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_86|) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_204| (+ |v_ULTIMATE.start_main_~j~0#1_205| 1)))) is different from false