./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:30:01,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:30:01,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:30:01,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:30:01,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:30:01,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:30:01,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:30:01,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:30:01,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:30:01,715 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:30:01,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:30:01,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:30:01,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:30:01,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:30:01,717 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:30:01,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:30:01,718 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:30:01,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:30:01,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:30:01,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:30:01,719 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:30:01,722 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:30:01,723 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:30:01,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:30:01,723 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:30:01,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:30:01,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:30:01,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:30:01,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:30:01,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:30:01,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:30:01,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:30:01,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:30:01,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:30:01,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:30:01,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:30:01,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:30:01,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:30:01,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:30:01,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:30:01,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:30:01,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:30:01,733 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2024-11-10 15:30:01,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:30:02,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:30:02,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:30:02,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:30:02,029 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:30:02,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2024-11-10 15:30:03,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:30:03,693 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:30:03,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2024-11-10 15:30:03,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f2cc4b1/81cc25b3ad634ab7a25d8073766c4f1c/FLAG2a324fba2 [2024-11-10 15:30:04,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f2cc4b1/81cc25b3ad634ab7a25d8073766c4f1c [2024-11-10 15:30:04,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:30:04,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:30:04,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:30:04,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:30:04,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:30:04,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4766b6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04, skipping insertion in model container [2024-11-10 15:30:04,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:30:04,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:30:04,411 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:30:04,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:30:04,497 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:30:04,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04 WrapperNode [2024-11-10 15:30:04,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:30:04,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:30:04,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:30:04,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:30:04,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,547 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 138 [2024-11-10 15:30:04,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:30:04,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:30:04,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:30:04,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:30:04,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,640 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 6, 12]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-10 15:30:04,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:30:04,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:30:04,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:30:04,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:30:04,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (1/1) ... [2024-11-10 15:30:04,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:30:04,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:04,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:30:04,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:30:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:30:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:30:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 15:30:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:30:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:30:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 15:30:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-10 15:30:04,758 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-10 15:30:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:30:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:30:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:30:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:30:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:30:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:30:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:30:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:30:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:30:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:30:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:30:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:30:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 15:30:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:30:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:30:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:30:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:30:04,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:30:04,878 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:30:04,880 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:30:05,133 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-10 15:30:05,158 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-10 15:30:05,182 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-10 15:30:05,183 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:30:05,200 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:30:05,203 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:30:05,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:30:05 BoogieIcfgContainer [2024-11-10 15:30:05,203 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:30:05,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:30:05,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:30:05,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:30:05,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:30:04" (1/3) ... [2024-11-10 15:30:05,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eae637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:30:05, skipping insertion in model container [2024-11-10 15:30:05,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:30:04" (2/3) ... [2024-11-10 15:30:05,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eae637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:30:05, skipping insertion in model container [2024-11-10 15:30:05,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:30:05" (3/3) ... [2024-11-10 15:30:05,210 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2024-11-10 15:30:05,223 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:30:05,223 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-11-10 15:30:05,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:30:05,269 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;@38d339e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:30:05,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-10 15:30:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 102 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:30:05,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:05,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:05,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash 821439157, now seen corresponding path program 1 times [2024-11-10 15:30:05,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:05,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826106737] [2024-11-10 15:30:05,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:05,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:30:05,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826106737] [2024-11-10 15:30:05,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826106737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:05,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:05,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:30:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974749639] [2024-11-10 15:30:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:05,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:30:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:05,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:30:05,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:30:05,626 INFO L87 Difference]: Start difference. First operand has 106 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 102 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:30:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:05,734 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-10 15:30:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:30:05,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-11-10 15:30:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:05,744 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:30:05,745 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 15:30:05,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:30:05,752 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:05,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 170 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:30:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 15:30:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-10 15:30:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 59 states have (on average 1.7457627118644068) internal successors, (103), 95 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2024-11-10 15:30:05,796 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 8 [2024-11-10 15:30:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:05,796 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2024-11-10 15:30:05,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:30:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2024-11-10 15:30:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:30:05,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:05,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:05,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:30:05,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:05,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:05,798 INFO L85 PathProgramCache]: Analyzing trace with hash 821439158, now seen corresponding path program 1 times [2024-11-10 15:30:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593930355] [2024-11-10 15:30:05,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:05,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:30:05,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:05,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593930355] [2024-11-10 15:30:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593930355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:05,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:05,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:30:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275670100] [2024-11-10 15:30:05,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:05,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:30:05,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:05,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:30:05,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:30:05,968 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:30:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:06,039 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-10 15:30:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:30:06,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-11-10 15:30:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:06,043 INFO L225 Difference]: With dead ends: 97 [2024-11-10 15:30:06,044 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 15:30:06,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:30:06,046 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:06,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 169 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:30:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 15:30:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-10 15:30:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 93 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-11-10 15:30:06,060 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 8 [2024-11-10 15:30:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:06,061 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-11-10 15:30:06,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:30:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-11-10 15:30:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:30:06,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:06,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:06,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:30:06,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:06,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash -371363819, now seen corresponding path program 1 times [2024-11-10 15:30:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:06,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922395137] [2024-11-10 15:30:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:06,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:30:06,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:06,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922395137] [2024-11-10 15:30:06,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922395137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:06,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:06,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:30:06,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314256862] [2024-11-10 15:30:06,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:06,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:30:06,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:30:06,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:30:06,289 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 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-11-10 15:30:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:06,500 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2024-11-10 15:30:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:30:06,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 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-11-10 15:30:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:06,501 INFO L225 Difference]: With dead ends: 96 [2024-11-10 15:30:06,502 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 15:30:06,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:30:06,504 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:06,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 366 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:30:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 15:30:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 15:30:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.694915254237288) internal successors, (100), 92 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2024-11-10 15:30:06,517 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 14 [2024-11-10 15:30:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:06,519 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2024-11-10 15:30:06,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 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-11-10 15:30:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2024-11-10 15:30:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:30:06,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:06,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:06,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:30:06,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:06,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash -371363818, now seen corresponding path program 1 times [2024-11-10 15:30:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:06,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561345751] [2024-11-10 15:30:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:30:06,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:06,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561345751] [2024-11-10 15:30:06,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561345751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:06,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:06,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:30:06,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108828663] [2024-11-10 15:30:06,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:06,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:30:06,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:06,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:30:06,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:30:06,803 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 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-11-10 15:30:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:06,981 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-11-10 15:30:06,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:30:06,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 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-11-10 15:30:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:06,983 INFO L225 Difference]: With dead ends: 95 [2024-11-10 15:30:06,983 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 15:30:06,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:30:06,984 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:06,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 386 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:30:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 15:30:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 15:30:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 91 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-11-10 15:30:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-11-10 15:30:06,990 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 14 [2024-11-10 15:30:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-11-10 15:30:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 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-11-10 15:30:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-11-10 15:30:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:30:06,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:06,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:06,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:30:06,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:06,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 367983218, now seen corresponding path program 1 times [2024-11-10 15:30:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492545995] [2024-11-10 15:30:06,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:07,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:30:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:30:07,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:07,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492545995] [2024-11-10 15:30:07,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492545995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:07,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:07,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:30:07,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733915990] [2024-11-10 15:30:07,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:07,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:30:07,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:07,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:30:07,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:30:07,079 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:30:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:07,163 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-11-10 15:30:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:30:07,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2024-11-10 15:30:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:07,165 INFO L225 Difference]: With dead ends: 101 [2024-11-10 15:30:07,165 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 15:30:07,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:30:07,166 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:07,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 243 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:30:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 15:30:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-10 15:30:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 93 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-11-10 15:30:07,173 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 16 [2024-11-10 15:30:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:07,173 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-11-10 15:30:07,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:30:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-11-10 15:30:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:30:07,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:07,174 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:07,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:30:07,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:07,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:07,175 INFO L85 PathProgramCache]: Analyzing trace with hash -40611257, now seen corresponding path program 1 times [2024-11-10 15:30:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:07,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096843561] [2024-11-10 15:30:07,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:07,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:07,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 15:30:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 15:30:07,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:07,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096843561] [2024-11-10 15:30:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096843561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205460250] [2024-11-10 15:30:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:07,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:07,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:07,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:30:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:07,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:30:07,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:30:07,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 15:30:07,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205460250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:30:07,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:30:07,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-10 15:30:07,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043362974] [2024-11-10 15:30:07,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:07,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:30:07,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:07,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:30:07,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:30:07,577 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:30:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:07,679 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-10 15:30:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:30:07,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-10 15:30:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:07,681 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:30:07,681 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 15:30:07,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:30:07,682 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:07,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 246 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:30:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 15:30:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-10 15:30:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.606060606060606) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2024-11-10 15:30:07,695 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 29 [2024-11-10 15:30:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:07,696 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2024-11-10 15:30:07,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:30:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2024-11-10 15:30:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:30:07,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:07,697 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:07,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:30:07,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 15:30:07,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:07,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:07,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1222828910, now seen corresponding path program 2 times [2024-11-10 15:30:07,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:07,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733771362] [2024-11-10 15:30:07,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:07,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:08,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:08,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:08,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:08,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733771362] [2024-11-10 15:30:08,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733771362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:08,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556611501] [2024-11-10 15:30:08,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:30:08,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:08,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:08,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:08,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:30:08,636 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:30:08,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:30:08,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 15:30:08,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:08,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:30:08,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:08,744 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-10 15:30:08,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:08,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:30:08,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:08,914 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:30:08,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-10 15:30:09,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:09,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:09,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:30:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 12 not checked. [2024-11-10 15:30:09,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:09,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556611501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:09,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:09,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-11-10 15:30:09,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740466441] [2024-11-10 15:30:09,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:09,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 15:30:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:09,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 15:30:09,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-11-10 15:30:09,147 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:30:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:09,534 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-11-10 15:30:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:30:09,534 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2024-11-10 15:30:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:09,535 INFO L225 Difference]: With dead ends: 112 [2024-11-10 15:30:09,535 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 15:30:09,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=308, Unknown=1, NotChecked=36, Total=420 [2024-11-10 15:30:09,537 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 223 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:09,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 423 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 405 Invalid, 0 Unknown, 107 Unchecked, 0.3s Time] [2024-11-10 15:30:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 15:30:09,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2024-11-10 15:30:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-10 15:30:09,543 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 42 [2024-11-10 15:30:09,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:09,543 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-10 15:30:09,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:30:09,544 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-10 15:30:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:30:09,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:09,545 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:09,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:30:09,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 15:30:09,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:09,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1222828909, now seen corresponding path program 1 times [2024-11-10 15:30:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:09,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327441525] [2024-11-10 15:30:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:09,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:10,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:10,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:30:10,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327441525] [2024-11-10 15:30:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327441525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959225109] [2024-11-10 15:30:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:10,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:10,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:10,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:10,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:30:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:10,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 15:30:10,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:10,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:30:10,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:10,606 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-10 15:30:10,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:10,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:30:10,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:10,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:10,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:30:10,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:10,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:10,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:30:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-10 15:30:10,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:30:10,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959225109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:10,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:30:10,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-10 15:30:10,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17165818] [2024-11-10 15:30:10,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:10,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:30:10,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:10,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:30:10,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2024-11-10 15:30:10,848 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:10,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:10,962 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2024-11-10 15:30:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:30:10,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-10 15:30:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:10,964 INFO L225 Difference]: With dead ends: 95 [2024-11-10 15:30:10,964 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 15:30:10,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2024-11-10 15:30:10,965 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 4 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:10,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 293 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 119 Unchecked, 0.1s Time] [2024-11-10 15:30:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 15:30:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 15:30:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 90 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-11-10 15:30:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2024-11-10 15:30:10,973 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 42 [2024-11-10 15:30:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:10,973 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2024-11-10 15:30:10,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2024-11-10 15:30:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:30:10,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:10,978 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:10,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 15:30:11,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:11,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:11,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:11,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1934496589, now seen corresponding path program 1 times [2024-11-10 15:30:11,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:11,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007344643] [2024-11-10 15:30:11,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:11,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:11,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007344643] [2024-11-10 15:30:11,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007344643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:11,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814579474] [2024-11-10 15:30:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:11,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:11,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:11,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:11,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:30:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 15:30:11,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:11,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:30:11,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:11,731 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-10 15:30:11,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:11,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:30:11,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:11,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:11,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:30:11,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:11,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:11,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-11-10 15:30:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-10 15:30:11,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:30:11,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814579474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:11,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:30:11,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-10 15:30:11,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428455192] [2024-11-10 15:30:11,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:11,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:30:11,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:11,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:30:11,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=156, Unknown=1, NotChecked=24, Total=210 [2024-11-10 15:30:11,986 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:30:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:12,052 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-11-10 15:30:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:30:12,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-10 15:30:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:12,054 INFO L225 Difference]: With dead ends: 93 [2024-11-10 15:30:12,054 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 15:30:12,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=156, Unknown=1, NotChecked=24, Total=210 [2024-11-10 15:30:12,055 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 49 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:12,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 170 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 109 Unchecked, 0.1s Time] [2024-11-10 15:30:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 15:30:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 15:30:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4545454545454546) 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-11-10 15:30:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-11-10 15:30:12,059 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 46 [2024-11-10 15:30:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:12,059 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-11-10 15:30:12,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:30:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-11-10 15:30:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:30:12,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:12,060 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:12,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 15:30:12,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:12,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash -141061748, now seen corresponding path program 1 times [2024-11-10 15:30:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8510300] [2024-11-10 15:30:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:12,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:12,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:30:12,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:12,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8510300] [2024-11-10 15:30:12,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8510300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:12,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953989242] [2024-11-10 15:30:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:12,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:12,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:12,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:12,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:30:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:12,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 15:30:12,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:13,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:30:13,098 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-10 15:30:13,141 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-10 15:30:13,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-10 15:30:13,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:30:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:13,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:30:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953989242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:13,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:30:13,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-10 15:30:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439316600] [2024-11-10 15:30:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:30:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:13,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:30:13,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2024-11-10 15:30:13,166 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:13,304 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2024-11-10 15:30:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:30:13,305 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-11-10 15:30:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:13,305 INFO L225 Difference]: With dead ends: 93 [2024-11-10 15:30:13,306 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 15:30:13,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=368, Unknown=1, NotChecked=38, Total=462 [2024-11-10 15:30:13,306 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 6 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:13,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 334 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 157 Unchecked, 0.1s Time] [2024-11-10 15:30:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 15:30:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 15:30:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.4264705882352942) 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-11-10 15:30:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-11-10 15:30:13,311 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 47 [2024-11-10 15:30:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:13,311 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-11-10 15:30:13,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-11-10 15:30:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:30:13,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:13,312 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:13,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:30:13,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 15:30:13,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:13,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash -141061747, now seen corresponding path program 1 times [2024-11-10 15:30:13,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525284953] [2024-11-10 15:30:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:14,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:30:14,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:14,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525284953] [2024-11-10 15:30:14,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525284953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:14,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312658443] [2024-11-10 15:30:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:14,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:14,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:14,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:14,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:30:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:14,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-10 15:30:14,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:14,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:30:14,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:30:14,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:30:14,645 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-10 15:30:14,691 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:30:14,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:30:14,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:30:14,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:30:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2024-11-10 15:30:14,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:15,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312658443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:15,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:15,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2024-11-10 15:30:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836117575] [2024-11-10 15:30:15,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:15,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 15:30:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:15,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 15:30:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=850, Unknown=1, NotChecked=58, Total=992 [2024-11-10 15:30:15,075 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 28 states, 26 states have (on average 2.769230769230769) internal successors, (72), 24 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:30:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:16,054 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-10 15:30:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:30:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.769230769230769) internal successors, (72), 24 states have internal predecessors, (72), 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 47 [2024-11-10 15:30:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:16,056 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:30:16,056 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 15:30:16,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=180, Invalid=1985, Unknown=1, NotChecked=90, Total=2256 [2024-11-10 15:30:16,057 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 67 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:16,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1012 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 906 Invalid, 0 Unknown, 103 Unchecked, 0.5s Time] [2024-11-10 15:30:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 15:30:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-10 15:30:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2024-11-10 15:30:16,061 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 47 [2024-11-10 15:30:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:16,062 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2024-11-10 15:30:16,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.769230769230769) internal successors, (72), 24 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:30:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2024-11-10 15:30:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:30:16,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:16,063 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:16,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 15:30:16,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:16,264 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:16,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash -669616887, now seen corresponding path program 1 times [2024-11-10 15:30:16,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:16,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895623564] [2024-11-10 15:30:16,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:16,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:16,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:16,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-10 15:30:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895623564] [2024-11-10 15:30:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895623564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:16,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:16,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:30:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939698366] [2024-11-10 15:30:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:16,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:30:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:30:16,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:30:16,534 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:16,794 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2024-11-10 15:30:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:30:16,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2024-11-10 15:30:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:16,795 INFO L225 Difference]: With dead ends: 157 [2024-11-10 15:30:16,795 INFO L226 Difference]: Without dead ends: 157 [2024-11-10 15:30:16,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:30:16,796 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 81 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:16,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 478 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:30:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-10 15:30:16,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2024-11-10 15:30:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 100 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2024-11-10 15:30:16,802 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 48 [2024-11-10 15:30:16,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:16,802 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2024-11-10 15:30:16,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:16,802 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2024-11-10 15:30:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:30:16,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:16,803 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:16,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:30:16,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:16,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash -669616886, now seen corresponding path program 1 times [2024-11-10 15:30:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:16,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240449794] [2024-11-10 15:30:16,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:17,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:17,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240449794] [2024-11-10 15:30:17,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240449794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:17,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838484827] [2024-11-10 15:30:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:17,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:17,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:17,054 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:17,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:30:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:17,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 15:30:17,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:17,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:30:17,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:30:17,471 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 16 treesize of output 11 [2024-11-10 15:30:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:30:17,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:17,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:30:17,536 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 17 treesize of output 17 [2024-11-10 15:30:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:17,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838484827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:30:17,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:30:17,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2024-11-10 15:30:17,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975057929] [2024-11-10 15:30:17,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:17,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 15:30:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:17,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 15:30:17,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-10 15:30:17,728 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 20 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-10 15:30:21,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:30:25,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:30:29,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:30:33,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:30:37,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:30:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:38,155 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-11-10 15:30:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:30:38,156 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 20 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2024-11-10 15:30:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:38,157 INFO L225 Difference]: With dead ends: 101 [2024-11-10 15:30:38,157 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 15:30:38,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2024-11-10 15:30:38,158 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 119 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:38,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1068 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 360 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2024-11-10 15:30:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 15:30:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-10 15:30:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 95 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-10 15:30:38,161 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 48 [2024-11-10 15:30:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:38,161 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-10 15:30:38,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 20 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-10 15:30:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-10 15:30:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:30:38,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:38,164 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:38,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:30:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:38,365 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:38,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1886448536, now seen corresponding path program 1 times [2024-11-10 15:30:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:38,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166564692] [2024-11-10 15:30:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:39,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:39,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:30:39,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:39,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166564692] [2024-11-10 15:30:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166564692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:39,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429262367] [2024-11-10 15:30:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:39,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:39,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:39,582 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:39,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:30:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:39,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-10 15:30:39,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:39,998 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:30:39,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-10 15:30:40,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:30:40,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2024-11-10 15:30:40,287 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 15:30:40,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:30:40,433 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2024-11-10 15:30:40,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:40,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-10 15:30:40,492 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2024-11-10 15:30:40,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2024-11-10 15:30:40,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-10 15:30:40,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:30:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-10 15:30:40,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429262367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:41,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:41,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 44 [2024-11-10 15:30:41,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839623466] [2024-11-10 15:30:41,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:41,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-10 15:30:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:41,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-10 15:30:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2196, Unknown=1, NotChecked=94, Total=2450 [2024-11-10 15:30:41,179 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 45 states, 42 states have (on average 2.142857142857143) internal successors, (90), 39 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:30:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:42,588 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2024-11-10 15:30:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 15:30:42,588 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.142857142857143) internal successors, (90), 39 states have internal predecessors, (90), 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 52 [2024-11-10 15:30:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:42,589 INFO L225 Difference]: With dead ends: 110 [2024-11-10 15:30:42,589 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 15:30:42,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=312, Invalid=4247, Unknown=1, NotChecked=132, Total=4692 [2024-11-10 15:30:42,591 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 79 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:42,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1380 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1508 Invalid, 0 Unknown, 118 Unchecked, 0.8s Time] [2024-11-10 15:30:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 15:30:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2024-11-10 15:30:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 98 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-11-10 15:30:42,594 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 52 [2024-11-10 15:30:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:42,594 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-11-10 15:30:42,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.142857142857143) internal successors, (90), 39 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:30:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-11-10 15:30:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:30:42,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:42,596 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:42,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:30:42,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-10 15:30:42,799 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:42,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1886448535, now seen corresponding path program 1 times [2024-11-10 15:30:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:42,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998319208] [2024-11-10 15:30:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:44,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:30:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:44,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998319208] [2024-11-10 15:30:44,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998319208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:44,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672056236] [2024-11-10 15:30:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:44,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:44,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:44,443 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:44,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:30:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:44,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-10 15:30:44,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:44,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:30:45,100 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:30:45,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-10 15:30:45,116 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:30:45,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:30:45,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:30:45,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:30:45,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 19 [2024-11-10 15:30:45,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-10 15:30:45,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:30:45,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:45,657 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-10 15:30:45,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:45,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2024-11-10 15:30:45,696 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-10 15:30:45,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-10 15:30:45,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-10 15:30:45,705 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-11-10 15:30:45,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2024-11-10 15:30:45,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2024-11-10 15:30:45,917 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-11-10 15:30:45,921 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-11-10 15:30:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-10 15:30:45,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672056236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:46,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2024-11-10 15:30:46,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276414613] [2024-11-10 15:30:46,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:46,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-10 15:30:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:46,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-10 15:30:46,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2711, Unknown=1, NotChecked=104, Total=2970 [2024-11-10 15:30:46,362 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 42 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:30:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:48,158 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2024-11-10 15:30:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:30:48,159 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 42 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2024-11-10 15:30:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:48,160 INFO L225 Difference]: With dead ends: 110 [2024-11-10 15:30:48,160 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 15:30:48,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=310, Invalid=4805, Unknown=1, NotChecked=140, Total=5256 [2024-11-10 15:30:48,162 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 80 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:48,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1621 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1868 Invalid, 0 Unknown, 109 Unchecked, 0.9s Time] [2024-11-10 15:30:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 15:30:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2024-11-10 15:30:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 100 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-10 15:30:48,167 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 52 [2024-11-10 15:30:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:48,167 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-10 15:30:48,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 42 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:30:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-10 15:30:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:30:48,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:48,168 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:48,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:30:48,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 15:30:48,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:48,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1407110876, now seen corresponding path program 1 times [2024-11-10 15:30:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259375902] [2024-11-10 15:30:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:48,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:48,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-10 15:30:48,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:48,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259375902] [2024-11-10 15:30:48,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259375902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:48,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:48,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:30:48,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140121960] [2024-11-10 15:30:48,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:48,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:30:48,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:48,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:30:48,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:30:48,570 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:48,755 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2024-11-10 15:30:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:30:48,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2024-11-10 15:30:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:48,757 INFO L225 Difference]: With dead ends: 127 [2024-11-10 15:30:48,757 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 15:30:48,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:30:48,757 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 78 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:48,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 426 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:30:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 15:30:48,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2024-11-10 15:30:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 99 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2024-11-10 15:30:48,762 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 54 [2024-11-10 15:30:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:48,762 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2024-11-10 15:30:48,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2024-11-10 15:30:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:30:48,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:48,763 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:48,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:30:48,763 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:48,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1407110875, now seen corresponding path program 1 times [2024-11-10 15:30:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091906059] [2024-11-10 15:30:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:49,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:49,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:49,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:49,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091906059] [2024-11-10 15:30:49,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091906059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:49,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024510173] [2024-11-10 15:30:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:49,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:49,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:49,199 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:49,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:30:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:49,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 15:30:49,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:49,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:30:49,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:30:49,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:30:49,599 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18|) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-10 15:30:49,640 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:30:49,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:30:49,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:30:49,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:30:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2024-11-10 15:30:49,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:49,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024510173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:49,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:49,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2024-11-10 15:30:49,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779073276] [2024-11-10 15:30:49,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:49,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 15:30:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 15:30:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=741, Unknown=1, NotChecked=54, Total=870 [2024-11-10 15:30:49,877 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:30:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:50,571 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2024-11-10 15:30:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:30:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-10 15:30:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:50,572 INFO L225 Difference]: With dead ends: 134 [2024-11-10 15:30:50,572 INFO L226 Difference]: Without dead ends: 134 [2024-11-10 15:30:50,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=1425, Unknown=1, NotChecked=76, Total=1640 [2024-11-10 15:30:50,573 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 96 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:50,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 992 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 964 Invalid, 0 Unknown, 126 Unchecked, 0.5s Time] [2024-11-10 15:30:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-10 15:30:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2024-11-10 15:30:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 103 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2024-11-10 15:30:50,577 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 54 [2024-11-10 15:30:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:50,577 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2024-11-10 15:30:50,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:30:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2024-11-10 15:30:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:30:50,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:50,578 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-11-10 15:30:50,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 15:30:50,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 15:30:50,779 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:50,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1486685428, now seen corresponding path program 2 times [2024-11-10 15:30:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942570926] [2024-11-10 15:30:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:30:52,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:52,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942570926] [2024-11-10 15:30:52,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942570926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350063969] [2024-11-10 15:30:52,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:30:52,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:52,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:52,948 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:52,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:30:53,159 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:30:53,159 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:30:53,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-10 15:30:53,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:53,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:30:53,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:30:53,573 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:30:53,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-10 15:30:53,590 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:30:53,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-10 15:30:53,611 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:30:53,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:30:53,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-10 15:30:53,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-10 15:30:54,035 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 15:30:54,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-10 15:30:54,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-10 15:30:54,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:30:54,205 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2024-11-10 15:30:54,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:54,236 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-10 15:30:54,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-10 15:30:54,257 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-10 15:30:54,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-10 15:30:54,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-10 15:30:54,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-11-10 15:30:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-10 15:30:54,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:55,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350063969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:55,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:55,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 54 [2024-11-10 15:30:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741528795] [2024-11-10 15:30:55,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:55,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-10 15:30:55,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:55,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-10 15:30:55,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3233, Unknown=1, NotChecked=114, Total=3540 [2024-11-10 15:30:55,111 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 54 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 47 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:30:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:56,221 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2024-11-10 15:30:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 15:30:56,222 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 47 states have internal predecessors, (93), 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 57 [2024-11-10 15:30:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:56,223 INFO L225 Difference]: With dead ends: 143 [2024-11-10 15:30:56,223 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 15:30:56,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=278, Invalid=4555, Unknown=1, NotChecked=136, Total=4970 [2024-11-10 15:30:56,225 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 15 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:56,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1647 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1320 Invalid, 0 Unknown, 128 Unchecked, 0.8s Time] [2024-11-10 15:30:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 15:30:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2024-11-10 15:30:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.236842105263158) internal successors, (141), 129 states have internal predecessors, (141), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:30:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2024-11-10 15:30:56,232 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 57 [2024-11-10 15:30:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:56,233 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2024-11-10 15:30:56,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 47 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:30:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2024-11-10 15:30:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 15:30:56,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:56,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:56,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:30:56,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 15:30:56,434 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2024-11-10 15:30:56,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1656452060, now seen corresponding path program 1 times [2024-11-10 15:30:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:56,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971773949] [2024-11-10 15:30:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:56,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:57,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:30:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971773949] [2024-11-10 15:30:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971773949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071191206] [2024-11-10 15:30:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:57,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:57,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:57,254 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:57,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:30:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:57,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-10 15:30:57,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:57,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:30:57,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:30:57,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:30:57,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:30:57,812 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 12 treesize of output 4 [2024-11-10 15:30:58,012 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:30:58,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-10 15:30:58,027 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:30:58,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-10 15:30:58,043 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:30:58,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:30:58,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:30:58,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:30:58,486 INFO L349 Elim1Store]: treesize reduction 39, result has 40.9 percent of original size [2024-11-10 15:30:58,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2024-11-10 15:31:30,774 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 140 treesize of output 108 [2024-11-10 15:31:30,885 INFO L349 Elim1Store]: treesize reduction 12, result has 90.1 percent of original size [2024-11-10 15:31:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 195 [2024-11-10 15:31:31,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:31,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 81 [2024-11-10 15:31:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:31:31,283 INFO L311 TraceCheckSpWp]: Computing backward predicates...