./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:16:16,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:16:16,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:16:16,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:16:16,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:16:17,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:16:17,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:16:17,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:16:17,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:16:17,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:16:17,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:16:17,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:16:17,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:16:17,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:16:17,017 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:16:17,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:16:17,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:16:17,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:16:17,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:16:17,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:16:17,019 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:16:17,022 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:16:17,022 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:16:17,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:16:17,022 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:16:17,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:16:17,022 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:16:17,023 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:16:17,023 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:16:17,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:16:17,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:16:17,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:16:17,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:16:17,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:16:17,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:16:17,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:16:17,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:16:17,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:16:17,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:16:17,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:16:17,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:16:17,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:16:17,027 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-clean/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-clean/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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2024-10-11 18:16:17,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:16:17,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:16:17,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:16:17,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:16:17,272 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:16:17,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-10-11 18:16:18,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:16:18,784 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:16:18,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-10-11 18:16:18,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c95c49dcb/0b067112aae34a0da55b5be1598040c5/FLAG70e17bb6f [2024-10-11 18:16:18,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c95c49dcb/0b067112aae34a0da55b5be1598040c5 [2024-10-11 18:16:18,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:16:18,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:16:18,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:16:18,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:16:18,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:16:18,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:16:18" (1/1) ... [2024-10-11 18:16:18,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c8f50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:18, skipping insertion in model container [2024-10-11 18:16:18,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:16:18" (1/1) ... [2024-10-11 18:16:18,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:16:19,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:16:19,373 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:16:19,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:16:19,510 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:16:19,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19 WrapperNode [2024-10-11 18:16:19,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:16:19,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:16:19,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:16:19,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:16:19,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,597 INFO L138 Inliner]: procedures = 127, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2024-10-11 18:16:19,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:16:19,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:16:19,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:16:19,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:16:19,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,668 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 16, 6]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2024-10-11 18:16:19,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:16:19,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:16:19,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:16:19,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:16:19,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (1/1) ... [2024-10-11 18:16:19,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:16:19,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:19,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:16:19,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:16:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:16:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:16:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 18:16:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 18:16:19,839 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:16:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:16:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:16:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:16:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:16:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:16:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:16:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:16:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:16:20,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:16:20,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:16:20,365 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-11 18:16:20,366 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:16:20,405 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:16:20,406 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 18:16:20,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:16:20 BoogieIcfgContainer [2024-10-11 18:16:20,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:16:20,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:16:20,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:16:20,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:16:20,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:16:18" (1/3) ... [2024-10-11 18:16:20,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440d4de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:16:20, skipping insertion in model container [2024-10-11 18:16:20,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:19" (2/3) ... [2024-10-11 18:16:20,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440d4de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:16:20, skipping insertion in model container [2024-10-11 18:16:20,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:16:20" (3/3) ... [2024-10-11 18:16:20,416 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2024-10-11 18:16:20,430 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:16:20,431 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2024-10-11 18:16:20,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:16:20,483 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;@5c4aa532, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:16:20,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-11 18:16:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 96 states have internal predecessors, (112), 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-10-11 18:16:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:16:20,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:20,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:16:20,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:20,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1788653075, now seen corresponding path program 1 times [2024-10-11 18:16:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:20,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445972212] [2024-10-11 18:16:20,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:20,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:20,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445972212] [2024-10-11 18:16:20,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445972212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:20,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:20,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:16:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473415381] [2024-10-11 18:16:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:20,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:16:20,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:20,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:16:20,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:16:20,791 INFO L87 Difference]: Start difference. First operand has 100 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 96 states have internal predecessors, (112), 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10-11 18:16:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:20,892 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-10-11 18:16:20,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:16:20,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-10-11 18:16:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:20,901 INFO L225 Difference]: With dead ends: 96 [2024-10-11 18:16:20,902 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 18:16:20,903 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-10-11 18:16:20,907 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:20,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 142 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 18:16:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 18:16:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 47 states have (on average 2.106382978723404) internal successors, (99), 90 states have internal predecessors, (99), 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-10-11 18:16:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-10-11 18:16:20,956 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 6 [2024-10-11 18:16:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:20,957 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-10-11 18:16:20,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10-11 18:16:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-10-11 18:16:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:16:20,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:20,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:16:20,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:16:20,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:20,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1788653074, now seen corresponding path program 1 times [2024-10-11 18:16:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:20,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038169732] [2024-10-11 18:16:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:21,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038169732] [2024-10-11 18:16:21,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038169732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:21,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:21,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:16:21,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709708187] [2024-10-11 18:16:21,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:21,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:16:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:21,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:16:21,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:16:21,111 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10-11 18:16:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:21,200 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-10-11 18:16:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:16:21,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-10-11 18:16:21,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:21,202 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:16:21,202 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:16:21,202 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-10-11 18:16:21,203 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:21,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 144 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:16:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 18:16:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 87 states have internal predecessors, (96), 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-10-11 18:16:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-11 18:16:21,209 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 6 [2024-10-11 18:16:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:21,210 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-11 18:16:21,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10-11 18:16:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-11 18:16:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:16:21,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:21,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:21,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:16:21,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:21,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash 644676676, now seen corresponding path program 1 times [2024-10-11 18:16:21,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:21,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952123800] [2024-10-11 18:16:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:21,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:21,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:21,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952123800] [2024-10-11 18:16:21,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952123800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:21,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:21,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:16:21,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122028489] [2024-10-11 18:16:21,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:21,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:16:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:21,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:16:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:16:21,585 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-10-11 18:16:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:21,798 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-10-11 18:16:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:16:21,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-10-11 18:16:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:21,800 INFO L225 Difference]: With dead ends: 89 [2024-10-11 18:16:21,800 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 18:16:21,800 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-10-11 18:16:21,803 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:21,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 306 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 18:16:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 18:16:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 47 states have (on average 2.0) internal successors, (94), 85 states have internal predecessors, (94), 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-10-11 18:16:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-10-11 18:16:21,813 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 11 [2024-10-11 18:16:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:21,815 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-10-11 18:16:21,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-10-11 18:16:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-10-11 18:16:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:16:21,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:21,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:21,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:16:21,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:21,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:21,816 INFO L85 PathProgramCache]: Analyzing trace with hash 644676675, now seen corresponding path program 1 times [2024-10-11 18:16:21,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:21,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491771707] [2024-10-11 18:16:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:21,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:21,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:21,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491771707] [2024-10-11 18:16:21,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491771707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:21,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:21,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:16:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604432525] [2024-10-11 18:16:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:21,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:16:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:21,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:16:21,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:16:21,909 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-10-11 18:16:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:22,057 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-10-11 18:16:22,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:16:22,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-10-11 18:16:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:22,058 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:16:22,058 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:16:22,058 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-10-11 18:16:22,059 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 8 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:22,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 290 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:16:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 18:16:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 83 states have internal predecessors, (92), 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-10-11 18:16:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-10-11 18:16:22,064 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 11 [2024-10-11 18:16:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:22,065 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-10-11 18:16:22,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-10-11 18:16:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-10-11 18:16:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 18:16:22,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:22,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:22,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:16:22,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:22,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -817834319, now seen corresponding path program 1 times [2024-10-11 18:16:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:22,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058309795] [2024-10-11 18:16:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:22,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:22,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:16:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:22,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:22,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058309795] [2024-10-11 18:16:22,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058309795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:22,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:22,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:16:22,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095197312] [2024-10-11 18:16:22,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:22,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:16:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:22,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:16:22,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:16:22,143 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-10-11 18:16:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:22,226 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-10-11 18:16:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:16:22,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-10-11 18:16:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:22,228 INFO L225 Difference]: With dead ends: 97 [2024-10-11 18:16:22,228 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 18:16:22,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-11 18:16:22,229 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:22,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 197 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 18:16:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2024-10-11 18:16:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 48 states have (on average 1.9375) internal successors, (93), 84 states have internal predecessors, (93), 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-10-11 18:16:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-10-11 18:16:22,235 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 12 [2024-10-11 18:16:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:22,235 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-10-11 18:16:22,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-10-11 18:16:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-10-11 18:16:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:16:22,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:22,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:22,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:16:22,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:22,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1530935535, now seen corresponding path program 1 times [2024-10-11 18:16:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:22,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615511476] [2024-10-11 18:16:22,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:22,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615511476] [2024-10-11 18:16:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615511476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:16:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207975467] [2024-10-11 18:16:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:22,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:16:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:16:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:16:22,302 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-11 18:16:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:22,383 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2024-10-11 18:16:22,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:16:22,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-10-11 18:16:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:22,385 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:16:22,385 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:16:22,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-11 18:16:22,386 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:22,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:22,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:16:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 18:16:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 88 states have internal predecessors, (97), 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-10-11 18:16:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-10-11 18:16:22,392 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 14 [2024-10-11 18:16:22,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:22,392 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-10-11 18:16:22,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-11 18:16:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-10-11 18:16:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:16:22,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:22,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:22,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:16:22,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:22,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1460399469, now seen corresponding path program 1 times [2024-10-11 18:16:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:22,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122066999] [2024-10-11 18:16:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:22,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 18:16:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:16:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122066999] [2024-10-11 18:16:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122066999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083541085] [2024-10-11 18:16:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:22,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:22,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:22,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:22,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:16:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:22,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:16:22,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:22,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:16:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083541085] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:16:22,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:16:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-10-11 18:16:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527705806] [2024-10-11 18:16:22,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:22,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:16:22,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:22,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:16:22,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:16:22,689 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:16:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:22,768 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-10-11 18:16:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:16:22,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-10-11 18:16:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:22,769 INFO L225 Difference]: With dead ends: 95 [2024-10-11 18:16:22,769 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 18:16:22,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:16:22,770 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 9 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:22,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 196 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 18:16:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 18:16:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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-10-11 18:16:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-10-11 18:16:22,774 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 25 [2024-10-11 18:16:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:22,774 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-10-11 18:16:22,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:16:22,775 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-10-11 18:16:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:16:22,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:22,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 18:16:22,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:16:22,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:22,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:22,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1713381069, now seen corresponding path program 1 times [2024-10-11 18:16:22,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:22,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756815886] [2024-10-11 18:16:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:23,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:23,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:16:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:23,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:23,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756815886] [2024-10-11 18:16:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756815886] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:23,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488568819] [2024-10-11 18:16:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:23,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:23,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:23,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:23,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:16:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:23,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 18:16:23,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:23,397 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-10-11 18:16:23,452 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:16:23,452 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-10-11 18:16:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:23,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488568819] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:23,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:23,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2024-10-11 18:16:23,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602915886] [2024-10-11 18:16:23,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:23,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:16:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:16:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2024-10-11 18:16:23,505 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 12 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:23,774 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2024-10-11 18:16:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:16:23,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-11 18:16:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:23,775 INFO L225 Difference]: With dead ends: 94 [2024-10-11 18:16:23,775 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 18:16:23,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:16:23,776 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 5 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:23,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 390 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 398 Invalid, 0 Unknown, 97 Unchecked, 0.2s Time] [2024-10-11 18:16:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 18:16:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 18:16:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 89 states have internal predecessors, (98), 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-10-11 18:16:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2024-10-11 18:16:23,780 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 27 [2024-10-11 18:16:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:23,780 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2024-10-11 18:16:23,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2024-10-11 18:16:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:16:23,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:23,781 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 18:16:23,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:16:23,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:23,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:23,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:23,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1713381070, now seen corresponding path program 1 times [2024-10-11 18:16:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:23,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114313660] [2024-10-11 18:16:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:16:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:24,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:24,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114313660] [2024-10-11 18:16:24,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114313660] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:24,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455072350] [2024-10-11 18:16:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:24,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:24,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:24,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:24,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:16:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:16:24,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:24,577 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-10-11 18:16:24,709 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-10-11 18:16:24,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:24,733 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-10-11 18:16:24,741 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:24,741 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-10-11 18:16:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-11 18:16:24,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:24,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455072350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:24,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:24,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2024-10-11 18:16:24,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404212626] [2024-10-11 18:16:24,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:24,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:16:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:24,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:16:24,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2024-10-11 18:16:24,859 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 19 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:25,259 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2024-10-11 18:16:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:16:25,259 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-11 18:16:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:25,260 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:16:25,260 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:16:25,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=476, Unknown=1, NotChecked=44, Total=600 [2024-10-11 18:16:25,261 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:25,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 553 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 509 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2024-10-11 18:16:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:16:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 18:16:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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-10-11 18:16:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-10-11 18:16:25,265 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 27 [2024-10-11 18:16:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:25,265 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-10-11 18:16:25,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-10-11 18:16:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:16:25,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:25,266 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:25,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:16:25,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:25,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:25,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash -11229135, now seen corresponding path program 2 times [2024-10-11 18:16:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:25,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609503202] [2024-10-11 18:16:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:25,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:16:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:25,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 18:16:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:16:25,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609503202] [2024-10-11 18:16:25,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609503202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:25,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885256751] [2024-10-11 18:16:25,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:16:25,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:25,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:25,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:25,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:16:25,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:16:25,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:16:25,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 18:16:25,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:25,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:16:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885256751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:16:25,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:16:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2024-10-11 18:16:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389374499] [2024-10-11 18:16:25,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:25,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:16:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:25,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:16:25,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:16:25,809 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:16:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:25,935 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-10-11 18:16:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:16:25,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-10-11 18:16:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:25,936 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:16:25,936 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:16:25,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:16:25,937 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:25,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 487 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:16:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 18:16:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 88 states have internal predecessors, (96), 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-10-11 18:16:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-11 18:16:25,940 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 38 [2024-10-11 18:16:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:25,940 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-11 18:16:25,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:16:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-11 18:16:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:16:25,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:25,941 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:25,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:26,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 18:16:26,142 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:26,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash 808896077, now seen corresponding path program 1 times [2024-10-11 18:16:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019894857] [2024-10-11 18:16:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:26,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:16:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:26,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:16:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 18:16:26,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:26,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019894857] [2024-10-11 18:16:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019894857] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412682899] [2024-10-11 18:16:26,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:26,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:26,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:26,562 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:26,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:16:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:26,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 18:16:26,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:26,714 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-10-11 18:16:26,727 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-10-11 18:16:26,745 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-10-11 18:16:26,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:26,769 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-10-11 18:16:26,791 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-10-11 18:16:26,795 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-11 18:16:26,810 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:16:26,810 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 12 treesize of output 14 [2024-10-11 18:16:26,855 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-10-11 18:16:26,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:26,885 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-10-11 18:16:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 10 not checked. [2024-10-11 18:16:26,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412682899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:26,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:26,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2024-10-11 18:16:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013551315] [2024-10-11 18:16:26,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:26,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:16:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:26,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:16:26,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=124, Unknown=2, NotChecked=46, Total=210 [2024-10-11 18:16:26,931 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 14 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 18:16:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:27,208 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-10-11 18:16:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:16:27,209 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2024-10-11 18:16:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:27,209 INFO L225 Difference]: With dead ends: 99 [2024-10-11 18:16:27,209 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 18:16:27,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=190, Unknown=2, NotChecked=58, Total=306 [2024-10-11 18:16:27,210 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 134 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:27,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 275 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 341 Invalid, 0 Unknown, 192 Unchecked, 0.2s Time] [2024-10-11 18:16:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 18:16:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2024-10-11 18:16:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 83 states have internal predecessors, (91), 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-10-11 18:16:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-10-11 18:16:27,213 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 39 [2024-10-11 18:16:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:27,213 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-10-11 18:16:27,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 18:16:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-10-11 18:16:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:16:27,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:27,235 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:27,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:16:27,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 18:16:27,435 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:27,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash 808896078, now seen corresponding path program 1 times [2024-10-11 18:16:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:27,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961369533] [2024-10-11 18:16:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:27,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:16:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:28,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:16:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:16:28,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:28,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961369533] [2024-10-11 18:16:28,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961369533] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:28,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790023478] [2024-10-11 18:16:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:28,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:28,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:28,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:28,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:16:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:28,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 18:16:28,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:28,267 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-10-11 18:16:28,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:16:28,306 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-10-11 18:16:28,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:28,328 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-10-11 18:16:28,359 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-10-11 18:16:28,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:28,388 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-10-11 18:16:28,446 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-10-11 18:16:28,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:28,479 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-10-11 18:16:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 18:16:28,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:16:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790023478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:28,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:16:28,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 16 [2024-10-11 18:16:28,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343700296] [2024-10-11 18:16:28,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:28,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:16:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:28,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:16:28,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-10-11 18:16:28,498 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 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-10-11 18:16:28,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:28,590 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-10-11 18:16:28,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:16:28,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 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 39 [2024-10-11 18:16:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:28,591 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:16:28,591 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:16:28,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2024-10-11 18:16:28,592 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:28,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 191 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 108 Unchecked, 0.1s Time] [2024-10-11 18:16:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:16:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:16:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 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-10-11 18:16:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-10-11 18:16:28,594 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 39 [2024-10-11 18:16:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:28,595 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-10-11 18:16:28,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 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-10-11 18:16:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-10-11 18:16:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 18:16:28,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:28,595 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 18:16:28,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:16:28,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 18:16:28,797 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:28,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1238445137, now seen corresponding path program 1 times [2024-10-11 18:16:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:28,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592858997] [2024-10-11 18:16:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:29,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:16:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:16:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:29,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:29,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592858997] [2024-10-11 18:16:29,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592858997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:29,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639854043] [2024-10-11 18:16:29,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:29,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:29,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:29,098 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:29,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:16:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:29,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 18:16:29,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:29,434 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-10-11 18:16:29,510 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-10-11 18:16:29,526 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-11 18:16:29,544 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-11 18:16:29,544 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 16 treesize of output 18 [2024-10-11 18:16:29,570 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-10-11 18:16:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2024-10-11 18:16:29,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:29,661 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 18 treesize of output 10 [2024-10-11 18:16:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:16:29,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639854043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:16:29,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:16:29,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 19 [2024-10-11 18:16:29,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691384270] [2024-10-11 18:16:29,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:29,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 18:16:29,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:29,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 18:16:29,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=293, Unknown=1, NotChecked=34, Total=380 [2024-10-11 18:16:29,695 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 20 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 18:16:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:30,078 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2024-10-11 18:16:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:16:30,078 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 42 [2024-10-11 18:16:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:30,079 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:16:30,079 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:16:30,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=517, Unknown=1, NotChecked=46, Total=650 [2024-10-11 18:16:30,080 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 70 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:30,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 487 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 652 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2024-10-11 18:16:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:16:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:16:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.6) internal successors, (88), 79 states have internal predecessors, (88), 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-10-11 18:16:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2024-10-11 18:16:30,082 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 42 [2024-10-11 18:16:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:30,082 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-10-11 18:16:30,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 18:16:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2024-10-11 18:16:30,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 18:16:30,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:30,083 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 18:16:30,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:16:30,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:30,287 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:30,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1238445136, now seen corresponding path program 1 times [2024-10-11 18:16:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:30,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481728483] [2024-10-11 18:16:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:16:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:30,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:16:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:16:30,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:30,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481728483] [2024-10-11 18:16:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481728483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:30,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240375467] [2024-10-11 18:16:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:30,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:30,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:30,753 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:30,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:16:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:30,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 18:16:30,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:30,972 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-10-11 18:16:31,113 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-10-11 18:16:31,206 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:16:31,206 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 18 treesize of output 21 [2024-10-11 18:16:31,256 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-10-11 18:16:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:16:31,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240375467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:31,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:31,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-11 18:16:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908048578] [2024-10-11 18:16:31,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:31,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 18:16:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 18:16:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2024-10-11 18:16:31,430 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 22 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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-10-11 18:16:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:32,094 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-10-11 18:16:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:16:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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 42 [2024-10-11 18:16:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:32,095 INFO L225 Difference]: With dead ends: 96 [2024-10-11 18:16:32,095 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 18:16:32,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 18:16:32,096 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 77 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:32,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 726 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:16:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 18:16:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-10-11 18:16:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 87 states have internal predecessors, (96), 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-10-11 18:16:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-11 18:16:32,099 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 42 [2024-10-11 18:16:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:32,099 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-11 18:16:32,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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-10-11 18:16:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-11 18:16:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:16:32,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:32,100 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:32,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:32,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 18:16:32,301 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:32,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 262601584, now seen corresponding path program 1 times [2024-10-11 18:16:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:32,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357165817] [2024-10-11 18:16:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:32,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:32,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:16:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:32,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:16:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 18:16:32,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:32,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357165817] [2024-10-11 18:16:32,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357165817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:32,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117422107] [2024-10-11 18:16:32,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:32,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:32,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:32,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:32,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:16:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:32,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 18:16:32,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:32,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-10-11 18:16:32,741 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-10-11 18:16:32,770 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-10-11 18:16:32,774 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-10-11 18:16:32,833 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:32,833 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-10-11 18:16:32,838 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-10-11 18:16:32,905 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-10-11 18:16:32,926 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-10-11 18:16:32,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:32,948 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-10-11 18:16:32,990 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-10-11 18:16:33,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:33,018 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-10-11 18:16:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2024-10-11 18:16:33,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:33,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117422107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:33,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 19 [2024-10-11 18:16:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767492334] [2024-10-11 18:16:33,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:33,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:16:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:33,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:16:33,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=328, Unknown=1, NotChecked=36, Total=420 [2024-10-11 18:16:33,178 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 19 states, 17 states have (on average 3.5294117647058822) 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), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:16:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:33,653 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-10-11 18:16:33,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:16:33,653 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.5294117647058822) 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), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2024-10-11 18:16:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:33,654 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:16:33,654 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:16:33,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=695, Unknown=1, NotChecked=54, Total=870 [2024-10-11 18:16:33,655 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:33,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 447 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 623 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2024-10-11 18:16:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:16:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 18:16:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 84 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-10-11 18:16:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2024-10-11 18:16:33,659 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 43 [2024-10-11 18:16:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:33,659 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2024-10-11 18:16:33,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.5294117647058822) 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), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:16:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2024-10-11 18:16:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 18:16:33,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:33,660 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:33,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:16:33,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:33,865 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:33,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash -749965477, now seen corresponding path program 1 times [2024-10-11 18:16:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145410065] [2024-10-11 18:16:33,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:34,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:34,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:16:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:16:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:16:35,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:35,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145410065] [2024-10-11 18:16:35,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145410065] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:35,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506901676] [2024-10-11 18:16:35,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:35,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:35,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:35,141 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:35,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:16:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:35,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-11 18:16:35,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:35,600 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:35,601 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-10-11 18:16:35,688 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 13 treesize of output 9 [2024-10-11 18:16:35,743 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:16:35,744 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:16:35,875 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-10-11 18:16:35,881 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-10-11 18:16:36,002 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_73| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_73| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_73|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_73|) 0) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_73| 1)))) is different from true [2024-10-11 18:16:36,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:36,014 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-10-11 18:16:36,037 INFO L349 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2024-10-11 18:16:36,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2024-10-11 18:16:36,192 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 84 treesize of output 56 [2024-10-11 18:16:36,197 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 51 treesize of output 35 [2024-10-11 18:16:36,292 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-10-11 18:16:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-11 18:16:36,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:36,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506901676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:36,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:36,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2024-10-11 18:16:36,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705160808] [2024-10-11 18:16:36,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:36,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 18:16:36,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:36,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 18:16:36,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1827, Unknown=1, NotChecked=86, Total=2070 [2024-10-11 18:16:36,557 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 43 states, 35 states have (on average 2.2) internal successors, (77), 37 states have internal predecessors, (77), 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-10-11 18:16:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:37,846 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-10-11 18:16:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 18:16:37,847 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 2.2) internal successors, (77), 37 states have internal predecessors, (77), 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 45 [2024-10-11 18:16:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:37,847 INFO L225 Difference]: With dead ends: 103 [2024-10-11 18:16:37,847 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 18:16:37,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=322, Invalid=3463, Unknown=1, NotChecked=120, Total=3906 [2024-10-11 18:16:37,849 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 101 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:37,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1036 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1387 Invalid, 0 Unknown, 110 Unchecked, 0.7s Time] [2024-10-11 18:16:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 18:16:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2024-10-11 18:16:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.492063492063492) internal successors, (94), 85 states have internal predecessors, (94), 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-10-11 18:16:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-11 18:16:37,851 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 45 [2024-10-11 18:16:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:37,851 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-11 18:16:37,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 2.2) internal successors, (77), 37 states have internal predecessors, (77), 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-10-11 18:16:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-11 18:16:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 18:16:37,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:37,852 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:37,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 18:16:38,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 18:16:38,053 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:16:38,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash -749965476, now seen corresponding path program 1 times [2024-10-11 18:16:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:38,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014276979] [2024-10-11 18:16:38,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:39,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:16:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:39,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:16:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:16:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:16:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014276979] [2024-10-11 18:16:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014276979] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044987818] [2024-10-11 18:16:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:39,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:39,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:39,619 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:39,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:16:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:39,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-11 18:16:39,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:39,887 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-10-11 18:16:39,890 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-10-11 18:16:40,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:40,193 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-10-11 18:16:40,200 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 12 treesize of output 14 [2024-10-11 18:16:40,335 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 13 treesize of output 9 [2024-10-11 18:16:40,345 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 13 treesize of output 9 [2024-10-11 18:16:40,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:16:40,418 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-10-11 18:16:40,421 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 30 treesize of output 13 [2024-10-11 18:16:40,627 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-10-11 18:16:40,631 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-10-11 18:16:40,635 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-10-11 18:16:40,638 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-10-11 18:16:52,989 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_node_create_~temp~0#1.base_82| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_82|))) (= |c_#length| (store |c_old(#length)| |v_node_create_~temp~0#1.base_82| (select |c_#length| |v_node_create_~temp~0#1.base_82|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_82|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_82|) 0)))) is different from true [2024-10-11 18:16:53,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:53,011 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-10-11 18:16:53,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:53,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:53,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-10-11 18:16:53,056 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-10-11 18:16:53,056 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-10-11 18:16:53,064 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 26 treesize of output 21 [2024-10-11 18:16:53,203 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 75 treesize of output 51 [2024-10-11 18:16:53,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:53,214 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 64 treesize of output 48 [2024-10-11 18:16:53,352 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 31 treesize of output 13 [2024-10-11 18:16:53,387 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 9 treesize of output 3 [2024-10-11 18:16:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:16:53,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044987818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:53,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:53,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 49 [2024-10-11 18:16:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822850241] [2024-10-11 18:16:53,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:53,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 18:16:53,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:53,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 18:16:53,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2693, Unknown=4, NotChecked=104, Total=2970 [2024-10-11 18:16:53,988 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 50 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 43 states have internal predecessors, (78), 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-10-11 18:16:58,031 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-10-11 18:17:02,043 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-10-11 18:17:14,090 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-10-11 18:17:18,099 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-10-11 18:17:22,113 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-10-11 18:17:30,174 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-10-11 18:17:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:48,078 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-10-11 18:17:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 18:17:48,079 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 43 states have internal predecessors, (78), 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 45 [2024-10-11 18:17:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:48,081 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:17:48,081 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:17:48,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=337, Invalid=4768, Unknown=11, NotChecked=140, Total=5256 [2024-10-11 18:17:48,087 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 94 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 10 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:48,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1138 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1753 Invalid, 6 Unknown, 107 Unchecked, 25.2s Time] [2024-10-11 18:17:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:17:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-10-11 18:17:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.476923076923077) internal successors, (96), 87 states have internal predecessors, (96), 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-10-11 18:17:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-11 18:17:48,091 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 45 [2024-10-11 18:17:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:48,091 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-11 18:17:48,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 43 states have internal predecessors, (78), 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-10-11 18:17:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-11 18:17:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 18:17:48,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:48,096 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:17:48,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:48,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 18:17:48,297 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:17:48,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash -749971628, now seen corresponding path program 1 times [2024-10-11 18:17:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:48,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344607525] [2024-10-11 18:17:48,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:48,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:17:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:17:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:17:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 18:17:48,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:48,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344607525] [2024-10-11 18:17:48,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344607525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:48,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:48,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:48,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851253658] [2024-10-11 18:17:48,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:48,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:48,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:48,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:48,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:48,521 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:48,685 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-10-11 18:17:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:48,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-10-11 18:17:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:48,687 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:17:48,688 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:17:48,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-10-11 18:17:48,688 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 7 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:48,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 240 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:17:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:17:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 86 states have internal predecessors, (95), 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-10-11 18:17:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-11 18:17:48,697 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 45 [2024-10-11 18:17:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:48,697 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-11 18:17:48,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-11 18:17:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 18:17:48,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:48,698 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:17:48,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:17:48,698 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:17:48,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash -749971627, now seen corresponding path program 1 times [2024-10-11 18:17:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:48,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635242703] [2024-10-11 18:17:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:48,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:17:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:17:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:48,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:17:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 18:17:48,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:48,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635242703] [2024-10-11 18:17:48,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635242703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:48,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:48,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:48,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842048602] [2024-10-11 18:17:48,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:48,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:48,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:48,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:48,957 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:49,062 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-10-11 18:17:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:49,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-10-11 18:17:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:49,063 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:17:49,063 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:17:49,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-10-11 18:17:49,065 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:49,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 248 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:17:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 18:17:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 85 states have internal predecessors, (94), 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-10-11 18:17:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-11 18:17:49,068 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 45 [2024-10-11 18:17:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:49,068 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-11 18:17:49,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-11 18:17:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 18:17:49,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:49,069 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:49,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:17:49,069 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:17:49,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash 198386735, now seen corresponding path program 2 times [2024-10-11 18:17:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:49,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508435140] [2024-10-11 18:17:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:17:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:17:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:17:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:51,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508435140] [2024-10-11 18:17:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508435140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668825374] [2024-10-11 18:17:51,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:17:51,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:51,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:51,030 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:51,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:17:51,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:17:51,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:17:51,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-10-11 18:17:51,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:51,471 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-10-11 18:17:51,477 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-10-11 18:17:51,740 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:17:51,741 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-10-11 18:17:51,756 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:17:51,756 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-10-11 18:17:51,771 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:51,772 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-10-11 18:17:51,874 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 16 treesize of output 11 [2024-10-11 18:17:51,880 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 16 treesize of output 11 [2024-10-11 18:17:51,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:17:51,948 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 19 treesize of output 18 [2024-10-11 18:17:52,029 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:17:52,029 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 1 case distinctions, treesize of input 78 treesize of output 55 [2024-10-11 18:17:52,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-10-11 18:17:52,289 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:17:52,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 41 [2024-10-11 18:17:52,295 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-10-11 18:17:52,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-10-11 18:17:52,495 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_91| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_91| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_91|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_91|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_91| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_91|))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0))) is different from true [2024-10-11 18:17:52,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:52,516 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-11 18:17:52,517 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 102 treesize of output 69 [2024-10-11 18:17:52,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:52,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:52,523 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 50 treesize of output 38 [2024-10-11 18:17:52,536 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:17:52,536 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-10-11 18:17:52,705 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 99 treesize of output 63 [2024-10-11 18:17:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:17:52,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:53,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668825374] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:53,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:53,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2024-10-11 18:17:53,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678015324] [2024-10-11 18:17:53,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:53,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-11 18:17:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:53,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-11 18:17:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3116, Unknown=1, NotChecked=112, Total=3422 [2024-10-11 18:17:53,251 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 55 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 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-10-11 18:17:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:54,913 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2024-10-11 18:17:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 18:17:54,914 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 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 48 [2024-10-11 18:17:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:54,915 INFO L225 Difference]: With dead ends: 119 [2024-10-11 18:17:54,915 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 18:17:54,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=335, Invalid=5368, Unknown=1, NotChecked=148, Total=5852 [2024-10-11 18:17:54,917 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 12 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:54,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1461 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1668 Invalid, 0 Unknown, 117 Unchecked, 1.0s Time] [2024-10-11 18:17:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 18:17:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2024-10-11 18:17:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 107 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-10-11 18:17:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2024-10-11 18:17:54,921 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 48 [2024-10-11 18:17:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:54,921 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2024-10-11 18:17:54,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 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-10-11 18:17:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2024-10-11 18:17:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 18:17:54,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:54,921 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:17:54,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:55,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:55,122 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:17:55,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash 18940969, now seen corresponding path program 1 times [2024-10-11 18:17:55,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:55,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017263587] [2024-10-11 18:17:55,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:17:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:17:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:17:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 18:17:55,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017263587] [2024-10-11 18:17:55,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017263587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:55,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:55,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:17:55,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746497886] [2024-10-11 18:17:55,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:55,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:17:55,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:55,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:17:55,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:17:55,306 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-10-11 18:17:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:55,419 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2024-10-11 18:17:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:17:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 48 [2024-10-11 18:17:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:55,420 INFO L225 Difference]: With dead ends: 132 [2024-10-11 18:17:55,420 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 18:17:55,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:17:55,420 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:55,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 208 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 18:17:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113. [2024-10-11 18:17:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 104 states have internal predecessors, (116), 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-10-11 18:17:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2024-10-11 18:17:55,427 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 48 [2024-10-11 18:17:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:55,427 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2024-10-11 18:17:55,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-10-11 18:17:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2024-10-11 18:17:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 18:17:55,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:55,427 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:17:55,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 18:17:55,427 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 18:17:55,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash 18940970, now seen corresponding path program 1 times [2024-10-11 18:17:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:55,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749691705] [2024-10-11 18:17:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:17:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 18:17:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 18:17:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 18:17:55,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:55,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749691705] [2024-10-11 18:17:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749691705] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:55,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565235765] [2024-10-11 18:17:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:55,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:55,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:55,768 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:55,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:17:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 18:17:56,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:56,028 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-10-11 18:17:56,037 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-10-11 18:17:56,215 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-10-11 18:17:56,219 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-10-11 18:17:56,284 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.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_16| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_16|) 0))) is different from true [2024-10-11 18:17:56,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:56,309 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-10-11 18:17:56,315 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:17:56,315 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-10-11 18:17:56,383 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-10-11 18:17:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2024-10-11 18:17:56,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:56,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565235765] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:56,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2024-10-11 18:17:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503948060] [2024-10-11 18:17:56,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:56,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 18:17:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:56,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 18:17:56,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=536, Unknown=1, NotChecked=46, Total=650 [2024-10-11 18:17:56,526 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 23 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 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)