./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --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/list-simple/sll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:04:40,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:04:40,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:04:40,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:04:40,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:04:40,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:04:40,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:04:40,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:04:40,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:04:40,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:04:40,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:04:40,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:04:40,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:04:40,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:04:40,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:04:40,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:04:40,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:04:40,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:04:40,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:04:40,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:04:40,873 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:04:40,873 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:04:40,874 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:04:40,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:04:40,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:04:40,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:04:40,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:04:40,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:04:40,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:04:40,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:04:40,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:04:40,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:04:40,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:04:40,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:04:40,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:04:40,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:04:40,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:04:40,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:04:40,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:04:40,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:04:40,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:04:40,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:04:40,882 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-11-09 08:04:41,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:04:41,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:04:41,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:04:41,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:04:41,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:04:41,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-09 08:04:42,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:04:42,877 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:04:42,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-09 08:04:42,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df576f1fe/e333b1ac889449e68fab23502d0efa61/FLAG7962c57e1 [2024-11-09 08:04:43,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df576f1fe/e333b1ac889449e68fab23502d0efa61 [2024-11-09 08:04:43,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:04:43,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:04:43,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:04:43,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:04:43,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:04:43,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca2b658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43, skipping insertion in model container [2024-11-09 08:04:43,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:04:43,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:04:43,575 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:04:43,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:04:43,659 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:04:43,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43 WrapperNode [2024-11-09 08:04:43,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:04:43,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:04:43,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:04:43,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:04:43,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,715 INFO L138 Inliner]: procedures = 127, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 126 [2024-11-09 08:04:43,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:04:43,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:04:43,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:04:43,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:04:43,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,761 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-09 08:04:43,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:04:43,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:04:43,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:04:43,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:04:43,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (1/1) ... [2024-11-09 08:04:43,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:04:43,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:43,835 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 08:04:43,838 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 08:04:43,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:04:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:04:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 08:04:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:04:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:04:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 08:04:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 08:04:43,886 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 08:04:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:04:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:04:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 08:04:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:04:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:04:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 08:04:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:04:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:04:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 08:04:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:04:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 08:04:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 08:04:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 08:04:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:04:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:04:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 08:04:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:04:43,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:04:44,014 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:04:44,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:04:44,302 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2024-11-09 08:04:44,303 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:04:44,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:04:44,323 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 08:04:44,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:04:44 BoogieIcfgContainer [2024-11-09 08:04:44,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:04:44,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:04:44,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:04:44,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:04:44,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:04:43" (1/3) ... [2024-11-09 08:04:44,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ae1188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:04:44, skipping insertion in model container [2024-11-09 08:04:44,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:04:43" (2/3) ... [2024-11-09 08:04:44,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ae1188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:04:44, skipping insertion in model container [2024-11-09 08:04:44,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:04:44" (3/3) ... [2024-11-09 08:04:44,335 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-11-09 08:04:44,355 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:04:44,356 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2024-11-09 08:04:44,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:04:44,421 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;@666870d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:04:44,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-11-09 08:04:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 85 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 08:04:44,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:44,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:44,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:44,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:44,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1814181817, now seen corresponding path program 1 times [2024-11-09 08:04:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:44,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638575476] [2024-11-09 08:04:44,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:44,743 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 08:04:44,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:44,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638575476] [2024-11-09 08:04:44,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638575476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:44,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:04:44,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595220978] [2024-11-09 08:04:44,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:44,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:04:44,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:44,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:04:44,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:04:44,778 INFO L87 Difference]: Start difference. First operand has 89 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 85 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:04:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:44,914 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-09 08:04:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:04:44,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 08:04:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:44,927 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:04:44,928 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 08:04:44,929 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 08:04:44,933 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:44,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 140 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 08:04:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 08:04:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 79 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-09 08:04:44,970 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 7 [2024-11-09 08:04:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:44,971 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-09 08:04:44,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:04:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-09 08:04:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 08:04:44,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:44,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:44,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:04:44,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:44,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1814181818, now seen corresponding path program 1 times [2024-11-09 08:04:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:44,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095904086] [2024-11-09 08:04:44,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:44,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:45,135 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 08:04:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095904086] [2024-11-09 08:04:45,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095904086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:45,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:45,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:04:45,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164408126] [2024-11-09 08:04:45,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:45,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:04:45,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:45,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:04:45,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:04:45,141 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:04:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:45,221 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2024-11-09 08:04:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:04:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 08:04:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:45,223 INFO L225 Difference]: With dead ends: 81 [2024-11-09 08:04:45,223 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 08:04:45,224 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 08:04:45,225 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:45,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 139 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 08:04:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 08:04:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 49 states have (on average 1.6938775510204083) internal successors, (83), 77 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2024-11-09 08:04:45,236 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 7 [2024-11-09 08:04:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:45,236 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2024-11-09 08:04:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:04:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2024-11-09 08:04:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 08:04:45,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:45,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:45,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:04:45,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:45,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:45,239 INFO L85 PathProgramCache]: Analyzing trace with hash -724758592, now seen corresponding path program 1 times [2024-11-09 08:04:45,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:45,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985662369] [2024-11-09 08:04:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:45,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:04:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:45,472 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 08:04:45,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:45,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985662369] [2024-11-09 08:04:45,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985662369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:45,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:45,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:04:45,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688934766] [2024-11-09 08:04:45,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:45,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:04:45,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:45,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:04:45,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:04:45,477 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:04:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:45,680 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-09 08:04:45,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:04:45,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 08:04:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:45,683 INFO L225 Difference]: With dead ends: 80 [2024-11-09 08:04:45,684 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 08:04:45,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:04:45,685 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:45,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 296 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:04:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 08:04:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 08:04:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-09 08:04:45,700 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 13 [2024-11-09 08:04:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:45,701 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-09 08:04:45,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:04:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-09 08:04:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 08:04:45,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:45,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:45,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:04:45,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash -724758591, now seen corresponding path program 1 times [2024-11-09 08:04:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:45,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995833805] [2024-11-09 08:04:45,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:04:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:46,037 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 08:04:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:46,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995833805] [2024-11-09 08:04:46,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995833805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:46,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:46,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:04:46,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240346979] [2024-11-09 08:04:46,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:46,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:04:46,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:46,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:04:46,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:04:46,041 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:04:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:46,198 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2024-11-09 08:04:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:04:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 08:04:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:46,200 INFO L225 Difference]: With dead ends: 79 [2024-11-09 08:04:46,200 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 08:04:46,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:04:46,203 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:46,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 312 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 08:04:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 08:04:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.653061224489796) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-11-09 08:04:46,216 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 13 [2024-11-09 08:04:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:46,217 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-09 08:04:46,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:04:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-11-09 08:04:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 08:04:46,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:46,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:46,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:04:46,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:46,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1286960960, now seen corresponding path program 1 times [2024-11-09 08:04:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:46,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595004349] [2024-11-09 08:04:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 08:04:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:46,285 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 08:04:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595004349] [2024-11-09 08:04:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595004349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:46,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:46,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:04:46,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792026091] [2024-11-09 08:04:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:46,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:04:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:46,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:04:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:04:46,289 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:04:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:46,389 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-09 08:04:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:04:46,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-09 08:04:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:46,394 INFO L225 Difference]: With dead ends: 85 [2024-11-09 08:04:46,394 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 08:04:46,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 08:04:46,395 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:46,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 199 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 08:04:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2024-11-09 08:04:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.64) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-09 08:04:46,432 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 15 [2024-11-09 08:04:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:46,433 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-09 08:04:46,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:04:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-09 08:04:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:04:46,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:46,434 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:46,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:04:46,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:46,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1129086142, now seen corresponding path program 1 times [2024-11-09 08:04:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:46,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594908001] [2024-11-09 08:04:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:46,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:04:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:46,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 08:04:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:04:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594908001] [2024-11-09 08:04:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594908001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117701230] [2024-11-09 08:04:46,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:46,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:46,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:46,578 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 08:04:46,580 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 08:04:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:46,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:04:46,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:04:46,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:04:46,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117701230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:04:46,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:04:46,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-09 08:04:46,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949361395] [2024-11-09 08:04:46,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:46,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:04:46,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:46,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:04:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:04:46,806 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:04:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:46,903 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-09 08:04:46,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:04:46,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-09 08:04:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:46,905 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:04:46,905 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 08:04:46,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:04:46,906 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:46,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 276 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 08:04:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 08:04:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 81 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:04:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-11-09 08:04:46,911 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 28 [2024-11-09 08:04:46,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:46,911 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-11-09 08:04:46,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:04:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-09 08:04:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:04:46,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:46,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:46,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 08:04:47,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 08:04:47,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:47,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:47,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2049889280, now seen corresponding path program 2 times [2024-11-09 08:04:47,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:47,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446728800] [2024-11-09 08:04:47,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:47,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:04:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:04:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:04:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:04:47,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:47,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446728800] [2024-11-09 08:04:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446728800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:47,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027086457] [2024-11-09 08:04:47,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:04:47,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:47,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:47,679 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 08:04:47,681 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 08:04:47,834 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 08:04:47,834 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:04:47,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 08:04:47,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:47,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:04:47,895 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 5 treesize of output 3 [2024-11-09 08:04:47,928 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 08:04:48,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:48,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:04:48,051 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 5 treesize of output 3 [2024-11-09 08:04:48,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:48,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:04:48,183 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 5 treesize of output 3 [2024-11-09 08:04:48,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:48,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:04:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 08:04:48,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:04:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027086457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:04:48,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2024-11-09 08:04:48,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282883166] [2024-11-09 08:04:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:48,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:04:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:04:48,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-09 08:04:48,253 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:48,372 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2024-11-09 08:04:48,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:04:48,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-09 08:04:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:48,373 INFO L225 Difference]: With dead ends: 83 [2024-11-09 08:04:48,374 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 08:04:48,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2024-11-09 08:04:48,375 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:48,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 220 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 106 Unchecked, 0.1s Time] [2024-11-09 08:04:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 08:04:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 08:04:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:04:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2024-11-09 08:04:48,380 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 41 [2024-11-09 08:04:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:48,381 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2024-11-09 08:04:48,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-11-09 08:04:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:04:48,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:48,383 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:48,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 08:04:48,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 08:04:48,584 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:48,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2049889279, now seen corresponding path program 1 times [2024-11-09 08:04:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867664845] [2024-11-09 08:04:48,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:48,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:48,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:04:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:49,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:04:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:04:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 08:04:49,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867664845] [2024-11-09 08:04:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867664845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795736071] [2024-11-09 08:04:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:49,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:49,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:49,160 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 08:04:49,161 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 08:04:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:49,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 08:04:49,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:49,320 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 08:04:49,353 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 5 treesize of output 3 [2024-11-09 08:04:49,378 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 08:04:49,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:49,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:04:49,463 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 5 treesize of output 3 [2024-11-09 08:04:49,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:49,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:04:49,592 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 5 treesize of output 3 [2024-11-09 08:04:49,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:49,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:04:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 08:04:49,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:04:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795736071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:49,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:04:49,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-11-09 08:04:49,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158947819] [2024-11-09 08:04:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:49,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:04:49,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:04:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-09 08:04:49,669 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:49,775 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2024-11-09 08:04:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:04:49,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-09 08:04:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:49,776 INFO L225 Difference]: With dead ends: 80 [2024-11-09 08:04:49,776 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 08:04:49,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-11-09 08:04:49,777 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:49,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 235 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2024-11-09 08:04:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 08:04:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 08:04:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:04:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-11-09 08:04:49,782 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 41 [2024-11-09 08:04:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:49,782 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-11-09 08:04:49,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-11-09 08:04:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 08:04:49,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:49,784 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:49,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 08:04:49,984 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 08:04:49,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:49,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1587796862, now seen corresponding path program 1 times [2024-11-09 08:04:49,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:49,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259443694] [2024-11-09 08:04:49,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:49,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:04:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:04:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:04:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 08:04:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:50,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259443694] [2024-11-09 08:04:50,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259443694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:50,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:04:50,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704008918] [2024-11-09 08:04:50,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:50,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:04:50,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:50,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:04:50,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:04:50,126 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:50,223 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-11-09 08:04:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:04:50,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-09 08:04:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:50,225 INFO L225 Difference]: With dead ends: 90 [2024-11-09 08:04:50,225 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 08:04:50,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:04:50,226 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 49 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:50,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 190 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 08:04:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-11-09 08:04:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:04:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-09 08:04:50,233 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 45 [2024-11-09 08:04:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:50,233 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-09 08:04:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:04:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-09 08:04:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 08:04:50,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:50,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:50,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 08:04:50,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:50,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1587796861, now seen corresponding path program 1 times [2024-11-09 08:04:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:50,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051470122] [2024-11-09 08:04:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:50,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:04:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:04:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:04:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:04:50,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:50,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051470122] [2024-11-09 08:04:50,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051470122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:50,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694332165] [2024-11-09 08:04:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:50,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:50,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:50,557 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 08:04:50,558 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 08:04:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 08:04:50,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:50,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:04:50,744 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 08:04:50,781 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 5 treesize of output 3 [2024-11-09 08:04:50,786 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 5 treesize of output 3 [2024-11-09 08:04:50,808 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 08:04:50,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:50,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:04:50,856 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:04:50,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:04:50,916 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 5 treesize of output 3 [2024-11-09 08:04:50,936 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 08:04:50,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:50,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:04:51,024 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 5 treesize of output 3 [2024-11-09 08:04:51,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:51,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:04:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2024-11-09 08:04:51,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694332165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:51,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:04:51,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2024-11-09 08:04:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540560470] [2024-11-09 08:04:51,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:51,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 08:04:51,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 08:04:51,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=263, Unknown=2, NotChecked=66, Total=380 [2024-11-09 08:04:51,232 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:04:51,256 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|)))) is different from true [2024-11-09 08:04:51,259 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|)))) is different from true [2024-11-09 08:04:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:51,549 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-09 08:04:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 08:04:51,550 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2024-11-09 08:04:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:51,551 INFO L225 Difference]: With dead ends: 75 [2024-11-09 08:04:51,551 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 08:04:51,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=511, Unknown=4, NotChecked=196, Total=812 [2024-11-09 08:04:51,552 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:51,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 557 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 248 Unchecked, 0.2s Time] [2024-11-09 08:04:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 08:04:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 08:04:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 70 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:04:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2024-11-09 08:04:51,556 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 45 [2024-11-09 08:04:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:51,557 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2024-11-09 08:04:51,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:04:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2024-11-09 08:04:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 08:04:51,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:51,558 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:51,576 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 08:04:51,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:51,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1587643897, now seen corresponding path program 1 times [2024-11-09 08:04:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:51,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122680707] [2024-11-09 08:04:51,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:04:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:52,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:04:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:04:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 08:04:52,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122680707] [2024-11-09 08:04:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122680707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163579641] [2024-11-09 08:04:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:52,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:52,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:52,306 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 08:04:52,307 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 08:04:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:52,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 08:04:52,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:52,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:04:52,530 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 08:04:52,809 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 9 treesize of output 3 [2024-11-09 08:04:52,813 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 9 treesize of output 3 [2024-11-09 08:04:52,863 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2024-11-09 08:04:52,926 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 08:04:52,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 08:04:52,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 08:04:53,010 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 08:04:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2024-11-09 08:04:53,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163579641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:53,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:04:53,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2024-11-09 08:04:53,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956146407] [2024-11-09 08:04:53,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:53,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 08:04:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:53,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 08:04:53,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=796, Unknown=1, NotChecked=56, Total=930 [2024-11-09 08:04:53,288 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 27 states, 25 states have (on average 2.8) internal successors, (70), 23 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:04:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:54,292 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-09 08:04:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 08:04:54,292 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.8) internal successors, (70), 23 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2024-11-09 08:04:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:54,293 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:04:54,293 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 08:04:54,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=1816, Unknown=1, NotChecked=86, Total=2070 [2024-11-09 08:04:54,295 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:54,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 796 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 941 Invalid, 0 Unknown, 86 Unchecked, 0.5s Time] [2024-11-09 08:04:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 08:04:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 08:04:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 80 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:04:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-09 08:04:54,299 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 45 [2024-11-09 08:04:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:54,300 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-09 08:04:54,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.8) internal successors, (70), 23 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:04:54,300 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-09 08:04:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 08:04:54,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:54,301 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:54,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 08:04:54,505 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 08:04:54,506 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:54,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1587643898, now seen corresponding path program 1 times [2024-11-09 08:04:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:54,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744213738] [2024-11-09 08:04:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:54,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:54,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:04:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:54,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:04:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:54,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:04:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:04:54,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:54,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744213738] [2024-11-09 08:04:54,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744213738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:54,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260170692] [2024-11-09 08:04:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:54,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:54,884 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 08:04:54,886 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 08:04:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:55,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 08:04:55,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:55,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:04:55,268 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 9 treesize of output 3 [2024-11-09 08:04:55,288 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 08:04:55,342 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 08:04:55,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 08:04:55,362 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 08:04:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2024-11-09 08:04:55,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:55,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260170692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:55,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:04:55,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2024-11-09 08:04:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503174458] [2024-11-09 08:04:55,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:55,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 08:04:55,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:55,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 08:04:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=407, Unknown=1, NotChecked=40, Total=506 [2024-11-09 08:04:55,427 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:04:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:55,755 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-09 08:04:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 08:04:55,755 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2024-11-09 08:04:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:55,756 INFO L225 Difference]: With dead ends: 84 [2024-11-09 08:04:55,756 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 08:04:55,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=720, Unknown=1, NotChecked=54, Total=870 [2024-11-09 08:04:55,757 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:55,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 473 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 483 Invalid, 0 Unknown, 71 Unchecked, 0.2s Time] [2024-11-09 08:04:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 08:04:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 08:04:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:04:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-09 08:04:55,763 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 45 [2024-11-09 08:04:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:55,763 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-09 08:04:55,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:04:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-09 08:04:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 08:04:55,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:55,764 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:55,780 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 08:04:55,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:55,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:04:55,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2045827325, now seen corresponding path program 1 times [2024-11-09 08:04:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:55,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668978877] [2024-11-09 08:04:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:55,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:04:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:57,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:04:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:57,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:04:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:04:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668978877] [2024-11-09 08:04:57,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668978877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:57,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654203830] [2024-11-09 08:04:57,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:57,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:57,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:57,651 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 08:04:57,653 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 08:04:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:57,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-09 08:04:57,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:57,951 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 08:04:58,405 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:04:58,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:04:58,428 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 08:04:58,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 08:04:58,550 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 08:04:58,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:04:58,810 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 43 treesize of output 19 [2024-11-09 08:04:58,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:04:58,819 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 08:04:58,825 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 11 treesize of output 3 [2024-11-09 08:04:59,027 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 08:04:59,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:59,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2024-11-09 08:04:59,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:59,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 22 treesize of output 17 [2024-11-09 08:04:59,127 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 08:04:59,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 08:04:59,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 20 treesize of output 15 [2024-11-09 08:04:59,247 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 48 treesize of output 28 [2024-11-09 08:04:59,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 08:04:59,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2024-11-09 08:04:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 08:04:59,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:59,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654203830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:59,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:04:59,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2024-11-09 08:04:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454466392] [2024-11-09 08:04:59,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:59,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 08:04:59,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 08:04:59,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2805, Unknown=1, NotChecked=106, Total=3080 [2024-11-09 08:04:59,817 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 50 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 43 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 08:05:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:01,672 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-11-09 08:05:01,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 08:05:01,673 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 43 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2024-11-09 08:05:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:01,674 INFO L225 Difference]: With dead ends: 92 [2024-11-09 08:05:01,674 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 08:05:01,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=352, Invalid=5201, Unknown=1, NotChecked=146, Total=5700 [2024-11-09 08:05:01,675 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 62 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:01,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1135 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1625 Invalid, 0 Unknown, 98 Unchecked, 0.9s Time] [2024-11-09 08:05:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 08:05:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-11-09 08:05:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 82 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:05:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-11-09 08:05:01,679 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 49 [2024-11-09 08:05:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:01,680 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-11-09 08:05:01,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 43 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 08:05:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-11-09 08:05:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 08:05:01,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:01,681 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:01,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:01,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:01,882 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:05:01,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2045827324, now seen corresponding path program 1 times [2024-11-09 08:05:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:01,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557295342] [2024-11-09 08:05:01,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:01,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:05:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:02,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:05:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:02,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:05:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:05:03,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557295342] [2024-11-09 08:05:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557295342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14968247] [2024-11-09 08:05:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:03,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:03,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:03,012 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:03,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 08:05:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:03,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-09 08:05:03,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:03,378 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 08:05:03,486 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:05:03,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:05:03,588 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 5 treesize of output 3 [2024-11-09 08:05:03,597 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 08:05:03,801 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 13 treesize of output 5 [2024-11-09 08:05:03,806 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 08:05:03,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:05:03,990 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2024-11-09 08:05:04,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:04,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-09 08:05:04,049 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2024-11-09 08:05:04,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2024-11-09 08:05:04,201 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 50 treesize of output 30 [2024-11-09 08:05:04,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2024-11-09 08:05:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 08:05:04,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14968247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:04,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:05:04,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 45 [2024-11-09 08:05:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693083200] [2024-11-09 08:05:04,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:04,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 08:05:04,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 08:05:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2288, Unknown=1, NotChecked=96, Total=2550 [2024-11-09 08:05:04,778 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 46 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 40 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 08:05:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:06,084 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-11-09 08:05:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 08:05:06,085 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 40 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2024-11-09 08:05:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:06,085 INFO L225 Difference]: With dead ends: 92 [2024-11-09 08:05:06,085 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 08:05:06,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=322, Invalid=4373, Unknown=1, NotChecked=134, Total=4830 [2024-11-09 08:05:06,087 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 59 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:06,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1019 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1323 Invalid, 0 Unknown, 97 Unchecked, 0.7s Time] [2024-11-09 08:05:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 08:05:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-11-09 08:05:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 82 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:05:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-11-09 08:05:06,090 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 49 [2024-11-09 08:05:06,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:06,091 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-11-09 08:05:06,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 40 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 08:05:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-09 08:05:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:05:06,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:06,092 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:06,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 08:05:06,297 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:05:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1555402634, now seen corresponding path program 1 times [2024-11-09 08:05:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929105461] [2024-11-09 08:05:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:05:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:05:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:05:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 08:05:06,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:06,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929105461] [2024-11-09 08:05:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929105461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:06,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:06,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 08:05:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262980933] [2024-11-09 08:05:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:06,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 08:05:06,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:06,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 08:05:06,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:05:06,504 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:05:06,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:06,650 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-09 08:05:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 08:05:06,650 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2024-11-09 08:05:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:06,651 INFO L225 Difference]: With dead ends: 90 [2024-11-09 08:05:06,651 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 08:05:06,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:05:06,652 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 36 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:06,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 334 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 08:05:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-09 08:05:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:05:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-11-09 08:05:06,655 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 53 [2024-11-09 08:05:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:06,655 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-11-09 08:05:06,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 08:05:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-11-09 08:05:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:05:06,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:06,657 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:06,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 08:05:06,657 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:05:06,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1555402633, now seen corresponding path program 1 times [2024-11-09 08:05:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:06,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730799334] [2024-11-09 08:05:06,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:05:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:07,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:05:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:07,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:05:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:07,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:07,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730799334] [2024-11-09 08:05:07,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730799334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:07,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574425275] [2024-11-09 08:05:07,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:07,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:07,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:07,090 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:07,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 08:05:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:07,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 08:05:07,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:07,302 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 08:05:07,529 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 9 treesize of output 3 [2024-11-09 08:05:07,532 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 9 treesize of output 3 [2024-11-09 08:05:07,574 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14|))) (and (<= .cse0 0) (<= 0 (+ .cse0 4)))))) is different from true [2024-11-09 08:05:07,634 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 08:05:07,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 08:05:07,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 08:05:07,779 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 08:05:07,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:05:07,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2024-11-09 08:05:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2024-11-09 08:05:07,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574425275] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:08,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:05:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2024-11-09 08:05:08,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719067673] [2024-11-09 08:05:08,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:08,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 08:05:08,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:08,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 08:05:08,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=915, Unknown=1, NotChecked=60, Total=1056 [2024-11-09 08:05:08,073 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 29 states, 27 states have (on average 2.740740740740741) internal successors, (74), 25 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:05:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:08,920 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-11-09 08:05:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:05:08,920 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.740740740740741) internal successors, (74), 25 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2024-11-09 08:05:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:08,921 INFO L225 Difference]: With dead ends: 92 [2024-11-09 08:05:08,921 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 08:05:08,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=2169, Unknown=1, NotChecked=94, Total=2450 [2024-11-09 08:05:08,922 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 86 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:08,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 797 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 914 Invalid, 0 Unknown, 83 Unchecked, 0.5s Time] [2024-11-09 08:05:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 08:05:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-09 08:05:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:05:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2024-11-09 08:05:08,925 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 53 [2024-11-09 08:05:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:08,925 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2024-11-09 08:05:08,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.740740740740741) internal successors, (74), 25 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:05:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2024-11-09 08:05:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:05:08,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:08,926 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:08,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:09,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 08:05:09,127 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:05:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash -206648077, now seen corresponding path program 2 times [2024-11-09 08:05:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192015873] [2024-11-09 08:05:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:05:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:10,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:05:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:10,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:05:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:05:11,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:11,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192015873] [2024-11-09 08:05:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192015873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:11,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891554863] [2024-11-09 08:05:11,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:05:11,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:11,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:11,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:11,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 08:05:11,525 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 08:05:11,525 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:05:11,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-09 08:05:11,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:11,697 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 08:05:11,707 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 08:05:12,014 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:05:12,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 08:05:12,029 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:05:12,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 08:05:12,055 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 08:05:12,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 08:05:12,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 08:05:12,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 08:05:12,565 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 08:05:12,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-09 08:05:12,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:05:12,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 08:05:12,746 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 08:05:12,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:12,786 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 08:05:12,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-09 08:05:12,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:12,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:12,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-09 08:05:12,807 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 08:05:12,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 08:05:12,907 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 65 treesize of output 41 [2024-11-09 08:05:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 08:05:13,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:13,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891554863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:13,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:05:13,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2024-11-09 08:05:13,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131432571] [2024-11-09 08:05:13,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:13,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-09 08:05:13,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:13,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-09 08:05:13,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3345, Unknown=1, NotChecked=116, Total=3660 [2024-11-09 08:05:13,561 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 55 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 48 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 08:05:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:14,676 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2024-11-09 08:05:14,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 08:05:14,676 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 48 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2024-11-09 08:05:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:14,677 INFO L225 Difference]: With dead ends: 123 [2024-11-09 08:05:14,678 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 08:05:14,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=281, Invalid=4692, Unknown=1, NotChecked=138, Total=5112 [2024-11-09 08:05:14,679 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:14,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1311 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1299 Invalid, 0 Unknown, 111 Unchecked, 0.7s Time] [2024-11-09 08:05:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 08:05:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2024-11-09 08:05:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 109 states have internal predecessors, (119), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:05:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-09 08:05:14,683 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 53 [2024-11-09 08:05:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:14,684 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-09 08:05:14,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 48 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 08:05:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-09 08:05:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 08:05:14,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:14,684 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:14,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:14,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 08:05:14,885 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:05:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1401043929, now seen corresponding path program 1 times [2024-11-09 08:05:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614042601] [2024-11-09 08:05:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:05:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:05:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:05:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:15,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:15,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614042601] [2024-11-09 08:05:15,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614042601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:15,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415911303] [2024-11-09 08:05:15,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:15,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:15,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:15,110 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:15,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 08:05:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:15,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 08:05:15,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:15,404 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 16 treesize of output 8 [2024-11-09 08:05:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:05:15,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415911303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:15,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:15,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 13 [2024-11-09 08:05:15,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239368301] [2024-11-09 08:05:15,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:15,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 08:05:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:15,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 08:05:15,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:05:15,461 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:05:19,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:05:23,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:05:27,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:05:31,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:05:35,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:05:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:35,706 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2024-11-09 08:05:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 08:05:35,706 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2024-11-09 08:05:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:35,707 INFO L225 Difference]: With dead ends: 118 [2024-11-09 08:05:35,707 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 08:05:35,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-09 08:05:35,708 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 77 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:35,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 535 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-11-09 08:05:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 08:05:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 08:05:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 109 states have internal predecessors, (118), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:05:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2024-11-09 08:05:35,712 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 56 [2024-11-09 08:05:35,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:35,713 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2024-11-09 08:05:35,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:05:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2024-11-09 08:05:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 08:05:35,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:35,714 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:35,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 08:05:35,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 08:05:35,915 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:05:35,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash -971260377, now seen corresponding path program 1 times [2024-11-09 08:05:35,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:35,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083050637] [2024-11-09 08:05:35,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:35,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:36,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:05:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:36,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:05:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:36,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:05:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:05:36,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:36,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083050637] [2024-11-09 08:05:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083050637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307637290] [2024-11-09 08:05:36,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:36,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:36,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:36,704 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:36,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 08:05:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:36,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-09 08:05:36,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:36,939 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 6 treesize of output 5 [2024-11-09 08:05:37,206 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:05:37,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:05:37,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:05:37,484 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 38 treesize of output 10 [2024-11-09 08:05:37,489 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 08:05:37,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:05:37,690 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int)) (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_19|) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2024-11-09 08:05:37,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:37,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-11-09 08:05:37,747 INFO L349 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2024-11-09 08:05:37,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 69 [2024-11-09 08:05:38,091 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2024-11-09 08:05:38,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 51 [2024-11-09 08:05:38,228 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 80 treesize of output 56 [2024-11-09 08:05:38,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:05:38,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2024-11-09 08:05:38,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 17 [2024-11-09 08:05:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 08:05:38,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:43,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307637290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:43,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:05:43,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 49 [2024-11-09 08:05:43,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900014842] [2024-11-09 08:05:43,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:43,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 08:05:43,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:43,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 08:05:43,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=3146, Unknown=2, NotChecked=112, Total=3422 [2024-11-09 08:05:43,659 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 50 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 43 states have internal predecessors, (98), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:05:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:46,379 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-11-09 08:05:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 08:05:46,380 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 43 states have internal predecessors, (98), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2024-11-09 08:05:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:46,380 INFO L225 Difference]: With dead ends: 127 [2024-11-09 08:05:46,380 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 08:05:46,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=477, Invalid=7535, Unknown=2, NotChecked=176, Total=8190 [2024-11-09 08:05:46,382 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 117 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:46,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1202 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1967 Invalid, 0 Unknown, 101 Unchecked, 1.1s Time] [2024-11-09 08:05:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 08:05:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-11-09 08:05:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 112 states have internal predecessors, (121), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:05:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-11-09 08:05:46,386 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 58 [2024-11-09 08:05:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:46,386 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-11-09 08:05:46,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 43 states have internal predecessors, (98), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:05:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-11-09 08:05:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 08:05:46,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:46,387 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:46,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 08:05:46,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:46,588 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:05:46,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1710350066, now seen corresponding path program 1 times [2024-11-09 08:05:46,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:46,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752744027] [2024-11-09 08:05:46,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:46,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:48,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:05:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:05:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:48,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:05:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:05:48,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:48,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752744027] [2024-11-09 08:05:48,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752744027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:48,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481178136] [2024-11-09 08:05:48,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:48,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:48,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:48,772 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:48,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 08:05:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:48,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-09 08:05:48,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:49,245 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:05:49,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:05:49,261 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 08:05:49,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 08:05:49,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:05:49,374 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 13 treesize of output 9 [2024-11-09 08:05:49,641 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 61 treesize of output 19 [2024-11-09 08:05:49,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 3 [2024-11-09 08:05:49,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:05:49,652 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 08:05:50,084 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:05:50,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-11-09 08:05:50,087 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 11 treesize of output 3 [2024-11-09 08:05:50,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:50,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2024-11-09 08:05:50,112 INFO L349 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2024-11-09 08:05:50,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 41 [2024-11-09 08:05:50,134 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-09 08:05:50,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 08:05:50,600 INFO L349 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2024-11-09 08:05:50,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-11-09 08:05:50,614 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2024-11-09 08:05:50,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2024-11-09 08:05:50,891 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 199 treesize of output 151 [2024-11-09 08:05:50,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:05:50,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 141 [2024-11-09 08:05:51,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:05:51,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2024-11-09 08:05:51,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:05:51,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 66 [2024-11-09 08:05:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:05:51,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:53,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481178136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:53,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:05:53,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 29] total 60 [2024-11-09 08:05:53,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466188240] [2024-11-09 08:05:53,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:53,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-09 08:05:53,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:53,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-09 08:05:53,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=4755, Unknown=0, NotChecked=0, Total=4970 [2024-11-09 08:05:53,218 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 61 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 53 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:05:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:58,358 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2024-11-09 08:05:58,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-09 08:05:58,359 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 53 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 62 [2024-11-09 08:05:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:58,359 INFO L225 Difference]: With dead ends: 158 [2024-11-09 08:05:58,359 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 08:05:58,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2709 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=663, Invalid=11327, Unknown=0, NotChecked=0, Total=11990 [2024-11-09 08:05:58,363 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 231 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:58,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1348 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2618 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 08:05:58,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 08:05:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2024-11-09 08:05:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 114 states have internal predecessors, (122), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:05:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2024-11-09 08:05:58,369 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 62 [2024-11-09 08:05:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:58,369 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2024-11-09 08:05:58,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 53 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:05:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2024-11-09 08:05:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 08:05:58,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:58,371 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:58,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:58,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-09 08:05:58,571 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-09 08:05:58,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:58,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1481233716, now seen corresponding path program 1 times [2024-11-09 08:05:58,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:58,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595481067] [2024-11-09 08:05:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 08:05:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:59,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 08:05:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:59,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 08:05:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:06:00,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:00,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595481067] [2024-11-09 08:06:00,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595481067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:00,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162747684] [2024-11-09 08:06:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:00,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:00,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:00,085 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:00,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 08:06:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:00,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-09 08:06:00,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:00,576 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 08:06:00,710 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 08:06:00,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 08:06:00,857 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-09 08:06:00,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2024-11-09 08:06:00,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:06:01,171 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 42 treesize of output 14 [2024-11-09 08:06:01,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13 [2024-11-09 08:06:01,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:06:01,377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-09 08:06:01,391 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int)) (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (let ((.cse0 (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_node_create_#in~data#1| (select .cse0 0)) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| .cse0)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))))) is different from true [2024-11-09 08:06:01,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:01,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-11-09 08:06:01,445 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-09 08:06:01,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 08:06:01,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 25 [2024-11-09 08:06:01,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 58 treesize of output 16 [2024-11-09 08:06:02,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2024-11-09 08:06:02,277 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 37 treesize of output 25 [2024-11-09 08:06:02,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:02,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 31 [2024-11-09 08:06:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 08:06:02,519 INFO L311 TraceCheckSpWp]: Computing backward predicates...