./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test27-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/ldv-regression/test27-2.c -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 8b17e864f5b8145df67cb2b3dc045f82af33b1bd3c9c5e4c95275bcb385f71da --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:41:02,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:41:02,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:41:02,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:41:02,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:41:02,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:41:02,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:41:02,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:41:02,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:41:02,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:41:02,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:41:02,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:41:02,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:41:02,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:41:02,517 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:41:02,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:41:02,521 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:41:02,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:41:02,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:41:02,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:41:02,521 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:41:02,522 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:41:02,522 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:41:02,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:41:02,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:41:02,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:41:02,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:41:02,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:41:02,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:41:02,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:41:02,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:41:02,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:41:02,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:41:02,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:41:02,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:41:02,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:41:02,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:41:02,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:41:02,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:41:02,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:41:02,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:41:02,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:41:02,528 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 -> 8b17e864f5b8145df67cb2b3dc045f82af33b1bd3c9c5e4c95275bcb385f71da [2024-11-09 07:41:02,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:41:02,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:41:02,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:41:02,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:41:02,838 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:41:02,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test27-2.c [2024-11-09 07:41:04,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:41:04,472 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:41:04,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2024-11-09 07:41:04,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1abb9d3d1/f5aa964add5e49a282cc20e903204df9/FLAGd6eec5edb [2024-11-09 07:41:04,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1abb9d3d1/f5aa964add5e49a282cc20e903204df9 [2024-11-09 07:41:04,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:41:04,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:41:04,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:41:04,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:41:04,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:41:04,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:41:04" (1/1) ... [2024-11-09 07:41:04,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46af6875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:04, skipping insertion in model container [2024-11-09 07:41:04,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:41:04" (1/1) ... [2024-11-09 07:41:04,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:41:05,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:41:05,087 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:41:05,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:41:05,126 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:41:05,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05 WrapperNode [2024-11-09 07:41:05,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:41:05,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:41:05,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:41:05,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:41:05,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,172 INFO L138 Inliner]: procedures = 16, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2024-11-09 07:41:05,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:41:05,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:41:05,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:41:05,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:41:05,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,205 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 3, 4, 6]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 6 writes are split as follows [0, 2, 1, 1, 2]. [2024-11-09 07:41:05,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:41:05,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:41:05,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:41:05,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:41:05,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (1/1) ... [2024-11-09 07:41:05,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:41:05,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:05,276 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-09 07:41:05,284 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-09 07:41:05,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:41:05,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:41:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:41:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 07:41:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 07:41:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:41:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:41:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:41:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:41:05,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 07:41:05,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 07:41:05,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:41:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:41:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:41:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 07:41:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 07:41:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:41:05,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:41:05,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:41:05,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:41:05,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 07:41:05,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 07:41:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:41:05,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:41:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:41:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:41:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:41:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 07:41:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 07:41:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:41:05,456 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:41:05,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:41:05,789 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-09 07:41:05,789 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:41:05,802 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:41:05,805 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:41:05,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:41:05 BoogieIcfgContainer [2024-11-09 07:41:05,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:41:05,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:41:05,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:41:05,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:41:05,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:41:04" (1/3) ... [2024-11-09 07:41:05,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a812656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:41:05, skipping insertion in model container [2024-11-09 07:41:05,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:05" (2/3) ... [2024-11-09 07:41:05,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a812656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:41:05, skipping insertion in model container [2024-11-09 07:41:05,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:41:05" (3/3) ... [2024-11-09 07:41:05,817 INFO L112 eAbstractionObserver]: Analyzing ICFG test27-2.c [2024-11-09 07:41:05,834 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:41:05,834 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2024-11-09 07:41:05,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:41:05,892 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;@8d096d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:41:05,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-11-09 07:41:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 77 states have internal predecessors, (84), 0 states have call successors, (0), 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-09 07:41:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:41:05,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:05,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:41:05,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:05,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-09 07:41:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:05,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437005788] [2024-11-09 07:41:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:06,192 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-09 07:41:06,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:06,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437005788] [2024-11-09 07:41:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437005788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:06,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:06,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:41:06,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787445228] [2024-11-09 07:41:06,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:06,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:41:06,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:06,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:41:06,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:41:06,225 INFO L87 Difference]: Start difference. First operand has 78 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 77 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 07:41:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:06,319 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-09 07:41:06,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:06,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:41:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:06,330 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:41:06,330 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 07:41:06,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:41:06,338 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:06,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 41 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 07:41:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 07:41:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 37 states have (on average 2.027027027027027) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 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-09 07:41:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-09 07:41:06,374 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2024-11-09 07:41:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:06,374 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-09 07:41:06,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 07:41:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-09 07:41:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:41:06,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:06,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:41:06,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:41:06,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:06,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2024-11-09 07:41:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:06,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603331616] [2024-11-09 07:41:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:06,549 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-09 07:41:06,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603331616] [2024-11-09 07:41:06,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603331616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:06,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:41:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883340498] [2024-11-09 07:41:06,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:06,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:41:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:06,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:41:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:41:06,554 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 07:41:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:06,647 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-09 07:41:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:06,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:41:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:06,651 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:41:06,651 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:41:06,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:41:06,653 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:06,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:41:06,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-09 07:41:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 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-09 07:41:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-09 07:41:06,668 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 4 [2024-11-09 07:41:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:06,668 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-09 07:41:06,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 07:41:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-09 07:41:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:41:06,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:06,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:41:06,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:41:06,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:06,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 889659654, now seen corresponding path program 1 times [2024-11-09 07:41:06,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:06,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40921375] [2024-11-09 07:41:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:06,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:06,856 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-09 07:41:06,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:06,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40921375] [2024-11-09 07:41:06,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40921375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:06,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:06,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:41:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692806350] [2024-11-09 07:41:06,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:06,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:41:06,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:06,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:41:06,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:06,860 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-09 07:41:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:06,926 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-09 07:41:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:06,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:41:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:06,928 INFO L225 Difference]: With dead ends: 71 [2024-11-09 07:41:06,931 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 07:41:06,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:06,932 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:06,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 38 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 07:41:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-09 07:41:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 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-09 07:41:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-09 07:41:06,938 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 6 [2024-11-09 07:41:06,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:06,940 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-09 07:41:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-09 07:41:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-09 07:41:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:41:06,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:06,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:41:06,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:41:06,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash 889659655, now seen corresponding path program 1 times [2024-11-09 07:41:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:06,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359595615] [2024-11-09 07:41:06,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:07,087 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-09 07:41:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:07,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359595615] [2024-11-09 07:41:07,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359595615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:07,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:07,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:41:07,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908368511] [2024-11-09 07:41:07,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:07,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:41:07,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:07,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:41:07,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:07,092 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-09 07:41:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:07,174 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-09 07:41:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:07,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:41:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:07,176 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:41:07,178 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:41:07,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:07,180 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:07,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:41:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-09 07:41:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.853658536585366) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 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-09 07:41:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-09 07:41:07,190 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 6 [2024-11-09 07:41:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:07,190 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-09 07:41:07,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-09 07:41:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-09 07:41:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:41:07,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:07,191 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:07,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:41:07,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:07,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash -392442511, now seen corresponding path program 1 times [2024-11-09 07:41:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:07,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529573551] [2024-11-09 07:41:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:07,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:07,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529573551] [2024-11-09 07:41:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529573551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:07,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111723293] [2024-11-09 07:41:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:07,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:07,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:07,405 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-09 07:41:07,407 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-09 07:41:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:07,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:41:07,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:07,595 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 8 treesize of output 1 [2024-11-09 07:41:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:07,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:07,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111723293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:07,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:07,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2024-11-09 07:41:07,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869938081] [2024-11-09 07:41:07,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:07,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:41:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:07,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:41:07,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:41:07,805 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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-09 07:41:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:08,075 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-09 07:41:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:41:08,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:41:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:08,076 INFO L225 Difference]: With dead ends: 84 [2024-11-09 07:41:08,077 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 07:41:08,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:41:08,078 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 12 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:08,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 185 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:41:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 07:41:08,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 07:41:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.679245283018868) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 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-09 07:41:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-09 07:41:08,087 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 9 [2024-11-09 07:41:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:08,087 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-09 07:41:08,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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-09 07:41:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-09 07:41:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:41:08,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:08,088 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 07:41:08,107 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-09 07:41:08,288 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-09 07:41:08,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:08,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash 819867506, now seen corresponding path program 1 times [2024-11-09 07:41:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:08,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860633309] [2024-11-09 07:41:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:08,501 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-09 07:41:08,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860633309] [2024-11-09 07:41:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860633309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257889468] [2024-11-09 07:41:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:08,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:08,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:08,504 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-09 07:41:08,506 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-09 07:41:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:08,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:41:08,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:08,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:08,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-09 07:41:08,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:41:08,825 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-09 07:41:08,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:08,924 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-09 07:41:08,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257889468] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:08,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:08,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2024-11-09 07:41:08,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937290768] [2024-11-09 07:41:08,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:08,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:41:08,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:08,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:41:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:41:08,929 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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-09 07:41:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:09,093 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-09 07:41:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:41:09,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:41:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:09,095 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:41:09,095 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:41:09,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:41:09,096 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 8 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:09,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 157 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:41:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 07:41:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 86 states have internal predecessors, (90), 0 states have call successors, (0), 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-09 07:41:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2024-11-09 07:41:09,101 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 11 [2024-11-09 07:41:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:09,101 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2024-11-09 07:41:09,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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-09 07:41:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2024-11-09 07:41:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:41:09,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:09,103 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:09,120 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-09 07:41:09,303 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,SelfDestructingSolverStorable5 [2024-11-09 07:41:09,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:09,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:09,305 INFO L85 PathProgramCache]: Analyzing trace with hash -206773099, now seen corresponding path program 1 times [2024-11-09 07:41:09,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:09,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068431913] [2024-11-09 07:41:09,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:09,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 07:41:09,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:09,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068431913] [2024-11-09 07:41:09,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068431913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:09,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:09,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:41:09,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596514281] [2024-11-09 07:41:09,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:09,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:41:09,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:09,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:41:09,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:09,473 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:41:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:09,549 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2024-11-09 07:41:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:41:09,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:41:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:09,550 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:41:09,550 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:41:09,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:09,551 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 39 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:09,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 91 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:41:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-09 07:41:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 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-09 07:41:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-09 07:41:09,557 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 26 [2024-11-09 07:41:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:09,557 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-09 07:41:09,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:41:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-09 07:41:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:41:09,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:09,558 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2024-11-09 07:41:09,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:41:09,558 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:09,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash -206725433, now seen corresponding path program 2 times [2024-11-09 07:41:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:09,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506767620] [2024-11-09 07:41:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:09,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506767620] [2024-11-09 07:41:09,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506767620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:09,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391663809] [2024-11-09 07:41:09,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:41:09,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:09,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:09,921 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-09 07:41:09,922 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-09 07:41:10,019 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:41:10,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:41:10,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:41:10,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:10,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:10,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:41:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 07:41:10,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 07:41:10,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391663809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:10,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:10,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2024-11-09 07:41:10,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895725936] [2024-11-09 07:41:10,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:10,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:41:10,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:10,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:41:10,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:41:10,747 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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-09 07:41:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:11,140 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-11-09 07:41:11,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:41:11,141 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:41:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:11,142 INFO L225 Difference]: With dead ends: 93 [2024-11-09 07:41:11,142 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 07:41:11,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:41:11,144 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 78 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:11,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 180 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:41:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 07:41:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2024-11-09 07:41:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 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-09 07:41:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-09 07:41:11,151 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 26 [2024-11-09 07:41:11,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:11,152 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-09 07:41:11,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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-09 07:41:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-09 07:41:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:41:11,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:11,152 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:11,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:41:11,353 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-09 07:41:11,353 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:11,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2114920321, now seen corresponding path program 1 times [2024-11-09 07:41:11,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:11,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161503393] [2024-11-09 07:41:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:11,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:11,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:11,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161503393] [2024-11-09 07:41:11,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161503393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:11,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735908001] [2024-11-09 07:41:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:11,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:11,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:11,506 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-09 07:41:11,508 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-09 07:41:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:11,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:41:11,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:11,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735908001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:11,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 07:41:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202530739] [2024-11-09 07:41:11,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:11,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:41:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:11,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:41:11,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:41:11,755 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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-09 07:41:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:11,824 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2024-11-09 07:41:11,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:41:11,824 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 07:41:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:11,825 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:41:11,825 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:41:11,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:41:11,826 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:11,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 313 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:41:11,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 07:41:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 110 states have internal predecessors, (114), 0 states have call successors, (0), 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-09 07:41:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2024-11-09 07:41:11,832 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 27 [2024-11-09 07:41:11,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:11,832 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2024-11-09 07:41:11,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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-09 07:41:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2024-11-09 07:41:11,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 07:41:11,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:11,834 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:11,852 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-09 07:41:12,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:12,035 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:12,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:12,035 INFO L85 PathProgramCache]: Analyzing trace with hash -42931233, now seen corresponding path program 2 times [2024-11-09 07:41:12,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:12,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674691689] [2024-11-09 07:41:12,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:12,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-09 07:41:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674691689] [2024-11-09 07:41:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674691689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:12,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:12,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:41:12,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072327452] [2024-11-09 07:41:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:12,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:41:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:12,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:41:12,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:12,884 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-09 07:41:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:12,973 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2024-11-09 07:41:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:41:12,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-09 07:41:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:12,975 INFO L225 Difference]: With dead ends: 110 [2024-11-09 07:41:12,975 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:41:12,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:12,979 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 48 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:12,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 58 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:41:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 07:41:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.345679012345679) internal successors, (109), 107 states have internal predecessors, (109), 0 states have call successors, (0), 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-09 07:41:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2024-11-09 07:41:12,984 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 57 [2024-11-09 07:41:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:12,985 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2024-11-09 07:41:12,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-09 07:41:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2024-11-09 07:41:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 07:41:12,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:12,987 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:12,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:41:12,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:12,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash -43009715, now seen corresponding path program 1 times [2024-11-09 07:41:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:12,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236483510] [2024-11-09 07:41:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-11-09 07:41:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:13,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236483510] [2024-11-09 07:41:13,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236483510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:13,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237239187] [2024-11-09 07:41:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:13,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:13,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:13,401 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-09 07:41:13,402 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-09 07:41:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:13,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:41:13,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:13,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:41:13,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:13,609 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:41:13,619 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:41:13,632 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:41:13,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:13,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-09 07:41:13,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:41:13,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237239187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:13,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:41:13,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 07:41:13,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118031793] [2024-11-09 07:41:13,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:13,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:41:13,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:13,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:41:13,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:41:13,835 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-09 07:41:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:13,888 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2024-11-09 07:41:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:13,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-09 07:41:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:13,889 INFO L225 Difference]: With dead ends: 107 [2024-11-09 07:41:13,889 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 07:41:13,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:41:13,890 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:13,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 77 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 07:41:13,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-09 07:41:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 106 states have internal predecessors, (108), 0 states have call successors, (0), 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-09 07:41:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2024-11-09 07:41:13,894 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 57 [2024-11-09 07:41:13,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:13,894 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2024-11-09 07:41:13,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-09 07:41:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2024-11-09 07:41:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 07:41:13,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:13,896 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:13,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:41:14,096 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,SelfDestructingSolverStorable10 [2024-11-09 07:41:14,097 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:14,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash -43009716, now seen corresponding path program 1 times [2024-11-09 07:41:14,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:14,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854957920] [2024-11-09 07:41:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-09 07:41:14,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:14,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854957920] [2024-11-09 07:41:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854957920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:14,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:14,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:41:14,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265584743] [2024-11-09 07:41:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:14,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:41:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:14,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:41:14,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:14,438 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-09 07:41:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:14,480 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2024-11-09 07:41:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:14,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-09 07:41:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:14,481 INFO L225 Difference]: With dead ends: 106 [2024-11-09 07:41:14,481 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:41:14,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:14,482 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:14,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:41:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 07:41:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 105 states have internal predecessors, (107), 0 states have call successors, (0), 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-09 07:41:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2024-11-09 07:41:14,486 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 57 [2024-11-09 07:41:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:14,486 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2024-11-09 07:41:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-09 07:41:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2024-11-09 07:41:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 07:41:14,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:14,488 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:14,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:41:14,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:14,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1333301192, now seen corresponding path program 1 times [2024-11-09 07:41:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:14,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674436783] [2024-11-09 07:41:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 172 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:14,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:14,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674436783] [2024-11-09 07:41:14,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674436783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:14,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486423387] [2024-11-09 07:41:14,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:14,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:14,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:14,906 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-09 07:41:14,908 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-09 07:41:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:15,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:41:15,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 216 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:15,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:15,523 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 24 treesize of output 20 [2024-11-09 07:41:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 216 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:15,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486423387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:15,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:15,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2024-11-09 07:41:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354240067] [2024-11-09 07:41:15,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:15,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 07:41:15,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:15,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 07:41:15,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 07:41:15,901 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 38 states, 37 states have (on average 4.648648648648648) internal successors, (172), 38 states have internal predecessors, (172), 0 states have call successors, (0), 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-09 07:41:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:16,319 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2024-11-09 07:41:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:41:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.648648648648648) internal successors, (172), 38 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-09 07:41:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:16,321 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:41:16,321 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:41:16,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=621, Invalid=1731, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 07:41:16,323 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 83 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:16,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 280 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:41:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:41:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 07:41:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 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-09 07:41:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2024-11-09 07:41:16,328 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 58 [2024-11-09 07:41:16,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:16,329 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2024-11-09 07:41:16,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.648648648648648) internal successors, (172), 38 states have internal predecessors, (172), 0 states have call successors, (0), 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-09 07:41:16,329 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2024-11-09 07:41:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 07:41:16,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:16,330 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:16,346 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-09 07:41:16,530 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-09 07:41:16,531 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:16,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1617335983, now seen corresponding path program 1 times [2024-11-09 07:41:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:16,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424691086] [2024-11-09 07:41:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-09 07:41:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424691086] [2024-11-09 07:41:16,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424691086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:16,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:16,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:41:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369514235] [2024-11-09 07:41:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:16,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:41:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:16,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:41:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:41:16,878 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-09 07:41:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:16,919 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2024-11-09 07:41:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:16,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-09 07:41:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:16,921 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:41:16,921 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 07:41:16,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:41:16,922 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:16,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:41:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 07:41:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 07:41:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.271604938271605) internal successors, (103), 101 states have internal predecessors, (103), 0 states have call successors, (0), 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-09 07:41:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2024-11-09 07:41:16,924 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 59 [2024-11-09 07:41:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:16,925 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2024-11-09 07:41:16,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-09 07:41:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2024-11-09 07:41:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 07:41:16,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:16,926 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:16,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:41:16,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:16,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1617335984, now seen corresponding path program 1 times [2024-11-09 07:41:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600567451] [2024-11-09 07:41:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-09 07:41:17,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600567451] [2024-11-09 07:41:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600567451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:17,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:17,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:41:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178935064] [2024-11-09 07:41:17,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:17,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:41:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:17,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:41:17,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:17,432 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-09 07:41:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:17,511 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2024-11-09 07:41:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:41:17,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-09 07:41:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:17,512 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:41:17,512 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:41:17,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:41:17,513 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:17,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:41:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 07:41:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 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-09 07:41:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2024-11-09 07:41:17,516 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 59 [2024-11-09 07:41:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:17,517 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2024-11-09 07:41:17,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-09 07:41:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2024-11-09 07:41:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 07:41:17,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:17,518 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:17,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:41:17,518 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:17,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash -518281198, now seen corresponding path program 1 times [2024-11-09 07:41:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:17,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840090517] [2024-11-09 07:41:17,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:17,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-09 07:41:17,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:17,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840090517] [2024-11-09 07:41:17,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840090517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:17,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:17,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:41:17,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953972272] [2024-11-09 07:41:17,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:17,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:41:17,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:17,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:41:17,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:17,735 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-09 07:41:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:17,803 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2024-11-09 07:41:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:41:17,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-09 07:41:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:17,804 INFO L225 Difference]: With dead ends: 99 [2024-11-09 07:41:17,804 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:41:17,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:41:17,805 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 63 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:17,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 64 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:41:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 07:41:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 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-09 07:41:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2024-11-09 07:41:17,808 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 61 [2024-11-09 07:41:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:17,809 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2024-11-09 07:41:17,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-09 07:41:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2024-11-09 07:41:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 07:41:17,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:17,810 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:17,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:41:17,810 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:17,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash -518281197, now seen corresponding path program 1 times [2024-11-09 07:41:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438592936] [2024-11-09 07:41:17,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:17,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 172 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:18,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438592936] [2024-11-09 07:41:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438592936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339566754] [2024-11-09 07:41:18,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:18,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:18,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:18,515 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-09 07:41:18,517 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-09 07:41:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:18,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 07:41:18,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:18,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:18,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:18,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-09 07:41:18,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:41:18,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:18,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:18,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:41:18,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-09 07:41:18,799 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:41:18,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:18,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:18,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:18,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:18,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:18,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:18,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:18,823 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:18,824 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:18,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:18,834 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:18,844 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:41:18,851 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 8 treesize of output 1 [2024-11-09 07:41:18,855 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:19,074 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 11 treesize of output 7 [2024-11-09 07:41:19,081 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-09 07:41:19,112 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 17 treesize of output 9 [2024-11-09 07:41:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-09 07:41:19,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:41:19,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339566754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:19,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:41:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2024-11-09 07:41:19,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530367186] [2024-11-09 07:41:19,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:19,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:41:19,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:19,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:41:19,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:41:19,138 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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-09 07:41:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:19,256 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2024-11-09 07:41:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:41:19,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-09 07:41:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:19,257 INFO L225 Difference]: With dead ends: 98 [2024-11-09 07:41:19,257 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 07:41:19,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:41:19,258 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:19,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 103 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:41:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 07:41:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 07:41:19,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 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-09 07:41:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2024-11-09 07:41:19,260 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 61 [2024-11-09 07:41:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:19,260 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2024-11-09 07:41:19,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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-09 07:41:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2024-11-09 07:41:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 07:41:19,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:19,261 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:19,279 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-09 07:41:19,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:19,462 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-09 07:41:19,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1113152061, now seen corresponding path program 1 times [2024-11-09 07:41:19,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:19,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916111308] [2024-11-09 07:41:19,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:19,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:41:19,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:41:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:41:19,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:41:19,618 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:41:19,619 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 38 remaining) [2024-11-09 07:41:19,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2024-11-09 07:41:19,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2024-11-09 07:41:19,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2024-11-09 07:41:19,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2024-11-09 07:41:19,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2024-11-09 07:41:19,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2024-11-09 07:41:19,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2024-11-09 07:41:19,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2024-11-09 07:41:19,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2024-11-09 07:41:19,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2024-11-09 07:41:19,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2024-11-09 07:41:19,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2024-11-09 07:41:19,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2024-11-09 07:41:19,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2024-11-09 07:41:19,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2024-11-09 07:41:19,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2024-11-09 07:41:19,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2024-11-09 07:41:19,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2024-11-09 07:41:19,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2024-11-09 07:41:19,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2024-11-09 07:41:19,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2024-11-09 07:41:19,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2024-11-09 07:41:19,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2024-11-09 07:41:19,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2024-11-09 07:41:19,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2024-11-09 07:41:19,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2024-11-09 07:41:19,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2024-11-09 07:41:19,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2024-11-09 07:41:19,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2024-11-09 07:41:19,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2024-11-09 07:41:19,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 38 remaining) [2024-11-09 07:41:19,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 38 remaining) [2024-11-09 07:41:19,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 38 remaining) [2024-11-09 07:41:19,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 38 remaining) [2024-11-09 07:41:19,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 38 remaining) [2024-11-09 07:41:19,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (1 of 38 remaining) [2024-11-09 07:41:19,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2024-11-09 07:41:19,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:41:19,629 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:19,683 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:41:19,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:41:19 BoogieIcfgContainer [2024-11-09 07:41:19,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:41:19,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:41:19,689 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:41:19,689 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:41:19,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:41:05" (3/4) ... [2024-11-09 07:41:19,690 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 07:41:19,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:41:19,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:41:19,754 INFO L158 Benchmark]: Toolchain (without parser) took 14888.86ms. Allocated memory was 167.8MB in the beginning and 383.8MB in the end (delta: 216.0MB). Free memory was 113.1MB in the beginning and 150.8MB in the end (delta: -37.7MB). Peak memory consumption was 179.9MB. Max. memory is 16.1GB. [2024-11-09 07:41:19,755 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 131.0MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:41:19,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.35ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 99.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:41:19,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.28ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 97.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:41:19,755 INFO L158 Benchmark]: Boogie Preprocessor took 51.67ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 95.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:41:19,755 INFO L158 Benchmark]: RCFGBuilder took 580.29ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 71.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 07:41:19,755 INFO L158 Benchmark]: TraceAbstraction took 13878.89ms. Allocated memory was 167.8MB in the beginning and 383.8MB in the end (delta: 216.0MB). Free memory was 71.2MB in the beginning and 155.0MB in the end (delta: -83.8MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. [2024-11-09 07:41:19,756 INFO L158 Benchmark]: Witness Printer took 65.41ms. Allocated memory is still 383.8MB. Free memory was 155.0MB in the beginning and 150.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:41:19,757 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 131.0MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.35ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 99.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.28ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 97.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.67ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 95.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 580.29ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 71.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13878.89ms. Allocated memory was 167.8MB in the beginning and 383.8MB in the end (delta: 216.0MB). Free memory was 71.2MB in the beginning and 155.0MB in the end (delta: -83.8MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. * Witness Printer took 65.41ms. Allocated memory is still 383.8MB. Free memory was 155.0MB in the beginning and 150.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L23] struct cont cont; [L24] struct dummy dummy; [L25] struct dummy *dummies[10]; [L26] int a[10]; [L27] int i, *pa; [L28] i = __VERIFIER_nondet_int() [L29] int j = 0; VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=0] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=1] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=2] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=3] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=4] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=5] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=6] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=7] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=8] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=9] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() [L34] dummies[j] = 0 [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L29] COND FALSE !(j < 10) VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8] [L36] COND TRUE i >= 0 && i < 9 [L37] a[i] = i [L38] dummy.array = &a[i] [L39] dummies[i + 1] = &dummy [L40] cont.array = &dummies[0] [L41] EXPR cont.array [L41] EXPR cont.array[i] [L41] cont.array[i]->array - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 812 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 812 mSDsluCounter, 1902 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1098 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1690 IncrementalHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 804 mSDtfsCounter, 1690 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=9, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 899 NumberOfCodeBlocks, 879 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 939 ConstructedInterpolants, 0 QuantifiedInterpolants, 12557 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2040 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 29 InterpolantComputations, 12 PerfectInterpolantSequences, 2743/3112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 07:41:19,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)