./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/dll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:45:34,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:45:34,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:45:34,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:45:34,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:45:34,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:45:34,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:45:34,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:45:34,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:45:34,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:45:34,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:45:34,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:45:34,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:45:34,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:45:34,788 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:45:34,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:45:34,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:45:34,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:45:34,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:45:34,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:45:34,794 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:45:34,795 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:45:34,795 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:45:34,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:45:34,796 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:45:34,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:45:34,796 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:45:34,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:45:34,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:45:34,797 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:45:34,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:45:34,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:45:34,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:45:34,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:45:34,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:45:34,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:45:34,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:45:34,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:45:34,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:45:34,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:45:34,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:45:34,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:45:34,805 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2024-11-17 00:45:35,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:45:35,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:45:35,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:45:35,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:45:35,118 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:45:35,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2024-11-17 00:45:36,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:45:36,873 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:45:36,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2024-11-17 00:45:36,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda8426e1/ab7bcd6abec840cbbc1150482d7493f4/FLAG2055f46b4 [2024-11-17 00:45:37,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda8426e1/ab7bcd6abec840cbbc1150482d7493f4 [2024-11-17 00:45:37,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:45:37,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:45:37,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:45:37,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:45:37,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:45:37,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb434cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37, skipping insertion in model container [2024-11-17 00:45:37,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:45:37,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:45:37,592 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:45:37,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:45:37,736 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:45:37,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37 WrapperNode [2024-11-17 00:45:37,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:45:37,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:45:37,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:45:37,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:45:37,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,808 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 142 [2024-11-17 00:45:37,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:45:37,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:45:37,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:45:37,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:45:37,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,849 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 9, 18]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 15 writes are split as follows [0, 2, 13]. [2024-11-17 00:45:37,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:45:37,872 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:45:37,873 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:45:37,873 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:45:37,875 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (1/1) ... [2024-11-17 00:45:37,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:45:37,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:37,918 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-17 00:45:37,922 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-17 00:45:37,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:45:37,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:45:37,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 00:45:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:45:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:45:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 00:45:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-17 00:45:37,968 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-17 00:45:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:45:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:45:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:45:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:45:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:45:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:45:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:45:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:45:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:45:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:45:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:45:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 00:45:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 00:45:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:45:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:45:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:45:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:45:37,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:45:38,096 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:45:38,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:45:38,472 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: 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-17 00:45:38,509 INFO L1250 $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-17 00:45:38,535 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-11-17 00:45:38,535 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:45:38,554 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:45:38,554 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:45:38,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:45:38 BoogieIcfgContainer [2024-11-17 00:45:38,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:45:38,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:45:38,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:45:38,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:45:38,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:45:37" (1/3) ... [2024-11-17 00:45:38,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417a882a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:45:38, skipping insertion in model container [2024-11-17 00:45:38,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:37" (2/3) ... [2024-11-17 00:45:38,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417a882a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:45:38, skipping insertion in model container [2024-11-17 00:45:38,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:45:38" (3/3) ... [2024-11-17 00:45:38,569 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2024-11-17 00:45:38,586 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:45:38,586 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2024-11-17 00:45:38,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:45:38,647 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;@68b4cd37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:45:38,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-17 00:45:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 136 states have internal predecessors, (149), 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-17 00:45:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:45:38,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:38,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:45:38,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:38,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:38,671 INFO L85 PathProgramCache]: Analyzing trace with hash 763582196, now seen corresponding path program 1 times [2024-11-17 00:45:38,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:38,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144904007] [2024-11-17 00:45:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:38,948 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-17 00:45:38,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144904007] [2024-11-17 00:45:38,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144904007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:38,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:38,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:45:38,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154383464] [2024-11-17 00:45:38,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:38,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:45:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:45:38,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:45:38,993 INFO L87 Difference]: Start difference. First operand has 141 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 136 states have internal predecessors, (149), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:45:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:39,181 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2024-11-17 00:45:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:45:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:45:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:39,194 INFO L225 Difference]: With dead ends: 137 [2024-11-17 00:45:39,194 INFO L226 Difference]: Without dead ends: 133 [2024-11-17 00:45:39,196 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-17 00:45:39,200 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:39,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 215 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:45:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-17 00:45:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-17 00:45:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.875) internal successors, (135), 128 states have internal predecessors, (135), 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-17 00:45:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2024-11-17 00:45:39,257 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 6 [2024-11-17 00:45:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:39,257 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2024-11-17 00:45:39,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:45:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2024-11-17 00:45:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:45:39,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:39,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:45:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:45:39,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:39,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash 763582197, now seen corresponding path program 1 times [2024-11-17 00:45:39,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:39,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606436642] [2024-11-17 00:45:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:39,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:39,415 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-17 00:45:39,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:39,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606436642] [2024-11-17 00:45:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606436642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:39,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:39,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:45:39,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978768709] [2024-11-17 00:45:39,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:39,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:45:39,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:39,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:45:39,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:45:39,420 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:45:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:39,536 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2024-11-17 00:45:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:45:39,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:45:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:39,539 INFO L225 Difference]: With dead ends: 130 [2024-11-17 00:45:39,540 INFO L226 Difference]: Without dead ends: 130 [2024-11-17 00:45:39,540 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-17 00:45:39,541 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 3 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:39,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 217 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:45:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-17 00:45:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-17 00:45:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 125 states have internal predecessors, (132), 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-17 00:45:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2024-11-17 00:45:39,555 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 6 [2024-11-17 00:45:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:39,556 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2024-11-17 00:45:39,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:45:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2024-11-17 00:45:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:45:39,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:39,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:39,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:45:39,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash 449600022, now seen corresponding path program 1 times [2024-11-17 00:45:39,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:39,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866601301] [2024-11-17 00:45:39,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:39,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:39,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:39,760 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-17 00:45:39,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:39,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866601301] [2024-11-17 00:45:39,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866601301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:39,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:39,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:45:39,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062667531] [2024-11-17 00:45:39,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:39,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:45:39,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:39,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:45:39,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:45:39,768 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:45:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:39,948 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2024-11-17 00:45:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:45:39,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-17 00:45:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:39,950 INFO L225 Difference]: With dead ends: 142 [2024-11-17 00:45:39,950 INFO L226 Difference]: Without dead ends: 142 [2024-11-17 00:45:39,951 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-17 00:45:39,952 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 10 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:39,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 315 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:45:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-17 00:45:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2024-11-17 00:45:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 127 states have internal predecessors, (134), 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-17 00:45:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2024-11-17 00:45:39,967 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 15 [2024-11-17 00:45:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:39,967 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2024-11-17 00:45:39,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:45:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2024-11-17 00:45:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:45:39,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:39,972 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:39,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:45:39,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:39,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 233924731, now seen corresponding path program 1 times [2024-11-17 00:45:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:39,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026915746] [2024-11-17 00:45:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:45:40,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:40,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026915746] [2024-11-17 00:45:40,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026915746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:40,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:40,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:45:40,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614378657] [2024-11-17 00:45:40,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:40,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:45:40,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:40,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:45:40,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:45:40,210 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:45:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:40,497 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2024-11-17 00:45:40,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:40,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-17 00:45:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:40,499 INFO L225 Difference]: With dead ends: 131 [2024-11-17 00:45:40,501 INFO L226 Difference]: Without dead ends: 131 [2024-11-17 00:45:40,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-17 00:45:40,503 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 7 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:40,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 444 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:45:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-17 00:45:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-17 00:45:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 126 states have internal predecessors, (133), 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-17 00:45:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2024-11-17 00:45:40,517 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 25 [2024-11-17 00:45:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:40,518 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2024-11-17 00:45:40,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:45:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2024-11-17 00:45:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:45:40,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:40,519 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:40,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:45:40,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:40,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash 233924732, now seen corresponding path program 1 times [2024-11-17 00:45:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:40,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293377692] [2024-11-17 00:45:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:40,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:45:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293377692] [2024-11-17 00:45:40,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293377692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:40,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:40,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:45:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409395340] [2024-11-17 00:45:40,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:40,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:45:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:40,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:45:40,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:45:40,950 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:45:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:41,238 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2024-11-17 00:45:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:41,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-17 00:45:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:41,240 INFO L225 Difference]: With dead ends: 130 [2024-11-17 00:45:41,240 INFO L226 Difference]: Without dead ends: 130 [2024-11-17 00:45:41,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-17 00:45:41,242 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 6 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:41,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 476 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:45:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-17 00:45:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-17 00:45:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 125 states have internal predecessors, (132), 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-17 00:45:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2024-11-17 00:45:41,261 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 25 [2024-11-17 00:45:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:41,261 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2024-11-17 00:45:41,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:45:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2024-11-17 00:45:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:45:41,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:41,262 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] [2024-11-17 00:45:41,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:45:41,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:41,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1463370200, now seen corresponding path program 1 times [2024-11-17 00:45:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014336326] [2024-11-17 00:45:41,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:41,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:45:41,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014336326] [2024-11-17 00:45:41,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014336326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169890219] [2024-11-17 00:45:41,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:41,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:41,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:41,635 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-17 00:45:41,636 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-17 00:45:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:41,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 00:45:41,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:41,843 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-17 00:45:41,953 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:45:41,953 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-17 00:45:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:45:42,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:45:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169890219] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:45:42,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:45:42,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2024-11-17 00:45:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401023993] [2024-11-17 00:45:42,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:42,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 00:45:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:42,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 00:45:42,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:45:42,378 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:45:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:42,831 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2024-11-17 00:45:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:42,831 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-11-17 00:45:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:42,833 INFO L225 Difference]: With dead ends: 135 [2024-11-17 00:45:42,833 INFO L226 Difference]: Without dead ends: 135 [2024-11-17 00:45:42,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:45:42,835 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:42,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 633 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:45:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-17 00:45:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-17 00:45:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:45:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2024-11-17 00:45:42,842 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 27 [2024-11-17 00:45:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:42,842 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2024-11-17 00:45:42,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:45:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2024-11-17 00:45:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:45:42,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:42,843 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] [2024-11-17 00:45:42,862 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-17 00:45:43,047 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-17 00:45:43,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:43,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1463370201, now seen corresponding path program 1 times [2024-11-17 00:45:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:43,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047827672] [2024-11-17 00:45:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:43,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:45:43,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047827672] [2024-11-17 00:45:43,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047827672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:43,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074272725] [2024-11-17 00:45:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:43,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:43,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:43,578 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-17 00:45:43,579 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-17 00:45:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:43,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 00:45:43,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:43,727 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-17 00:45:43,914 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:45:43,915 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-17 00:45:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:45:43,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074272725] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:44,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:45:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-11-17 00:45:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91729229] [2024-11-17 00:45:44,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:44,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 00:45:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 00:45:44,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-17 00:45:44,078 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:45:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:44,669 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2024-11-17 00:45:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:45:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-17 00:45:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:44,671 INFO L225 Difference]: With dead ends: 136 [2024-11-17 00:45:44,671 INFO L226 Difference]: Without dead ends: 136 [2024-11-17 00:45:44,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:45:44,672 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:44,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 691 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:45:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-17 00:45:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2024-11-17 00:45:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.7564102564102564) internal successors, (137), 129 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:45:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2024-11-17 00:45:44,694 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 27 [2024-11-17 00:45:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:44,694 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2024-11-17 00:45:44,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:45:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2024-11-17 00:45:44,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:45:44,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:44,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:44,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:45:44,900 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-17 00:45:44,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:44,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1344572710, now seen corresponding path program 1 times [2024-11-17 00:45:44,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:44,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132200516] [2024-11-17 00:45:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:44,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:45,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:45:45,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:45,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132200516] [2024-11-17 00:45:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132200516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845929687] [2024-11-17 00:45:45,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:45,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:45,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:45,029 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-17 00:45:45,031 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-17 00:45:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:45,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:45:45,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:45:45,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:45:45,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845929687] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:45:45,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:45:45,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-17 00:45:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715971873] [2024-11-17 00:45:45,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:45,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:45:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:45:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:45:45,220 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:45:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:45,359 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2024-11-17 00:45:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:45,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-17 00:45:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:45,361 INFO L225 Difference]: With dead ends: 135 [2024-11-17 00:45:45,361 INFO L226 Difference]: Without dead ends: 135 [2024-11-17 00:45:45,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 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-17 00:45:45,362 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:45,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 663 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:45:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-17 00:45:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-17 00:45:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.7435897435897436) internal successors, (136), 129 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:45:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2024-11-17 00:45:45,367 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 30 [2024-11-17 00:45:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:45,367 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2024-11-17 00:45:45,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:45:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2024-11-17 00:45:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:45:45,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:45,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:45,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:45:45,569 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-17 00:45:45,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:45,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1296009417, now seen corresponding path program 1 times [2024-11-17 00:45:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:45,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538238109] [2024-11-17 00:45:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:45,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:45,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:45:45,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:45,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538238109] [2024-11-17 00:45:45,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538238109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:45,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117178937] [2024-11-17 00:45:45,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:45,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:45,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:45,688 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-17 00:45:45,690 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-17 00:45:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:45,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 00:45:45,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:45,832 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-17 00:45:45,889 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-17 00:45:45,938 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:45:45,938 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-17 00:45:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2024-11-17 00:45:45,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:46,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117178937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:46,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:45:46,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-11-17 00:45:46,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387232538] [2024-11-17 00:45:46,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:46,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:45:46,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:46,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:45:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-11-17 00:45:46,006 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:45:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:46,401 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2024-11-17 00:45:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:45:46,402 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-11-17 00:45:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:46,403 INFO L225 Difference]: With dead ends: 134 [2024-11-17 00:45:46,403 INFO L226 Difference]: Without dead ends: 134 [2024-11-17 00:45:46,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-11-17 00:45:46,404 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 9 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:46,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 665 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 518 Invalid, 0 Unknown, 136 Unchecked, 0.3s Time] [2024-11-17 00:45:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-17 00:45:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-17 00:45:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 128 states have internal predecessors, (135), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:45:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2024-11-17 00:45:46,413 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 31 [2024-11-17 00:45:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:46,413 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2024-11-17 00:45:46,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:45:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2024-11-17 00:45:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:45:46,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:46,414 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:46,441 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-17 00:45:46,615 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-17 00:45:46,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1296009416, now seen corresponding path program 1 times [2024-11-17 00:45:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:46,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600388212] [2024-11-17 00:45:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:45:46,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:46,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600388212] [2024-11-17 00:45:46,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600388212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:46,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432358668] [2024-11-17 00:45:46,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:46,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:46,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:46,885 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-17 00:45:46,887 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-17 00:45:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:47,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-17 00:45:47,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:47,035 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-17 00:45:47,041 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-17 00:45:47,182 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-17 00:45:47,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:45:47,224 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-17 00:45:47,233 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:45:47,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:45:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-17 00:45:47,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:47,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432358668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:47,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:45:47,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-17 00:45:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753948301] [2024-11-17 00:45:47,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:47,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 00:45:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:47,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 00:45:47,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-17 00:45:47,405 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:45:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:47,880 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2024-11-17 00:45:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:45:47,880 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-11-17 00:45:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:47,883 INFO L225 Difference]: With dead ends: 153 [2024-11-17 00:45:47,883 INFO L226 Difference]: Without dead ends: 153 [2024-11-17 00:45:47,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-11-17 00:45:47,884 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 12 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:47,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 990 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 607 Invalid, 0 Unknown, 160 Unchecked, 0.4s Time] [2024-11-17 00:45:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-17 00:45:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2024-11-17 00:45:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 89 states have (on average 1.696629213483146) internal successors, (151), 139 states have internal predecessors, (151), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:45:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2024-11-17 00:45:47,891 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 31 [2024-11-17 00:45:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:47,892 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2024-11-17 00:45:47,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:45:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2024-11-17 00:45:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:45:47,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:47,895 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:47,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:45:48,102 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-17 00:45:48,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:48,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1521586176, now seen corresponding path program 1 times [2024-11-17 00:45:48,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:48,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979882114] [2024-11-17 00:45:48,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:48,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:45:48,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:48,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979882114] [2024-11-17 00:45:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979882114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:48,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:45:48,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192430847] [2024-11-17 00:45:48,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:48,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:45:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:45:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:45:48,257 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:45:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:48,539 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2024-11-17 00:45:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:45:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-17 00:45:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:48,541 INFO L225 Difference]: With dead ends: 145 [2024-11-17 00:45:48,541 INFO L226 Difference]: Without dead ends: 145 [2024-11-17 00:45:48,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:45:48,542 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 7 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:48,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 504 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:45:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-17 00:45:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-17 00:45:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 89 states have (on average 1.6853932584269662) internal successors, (150), 138 states have internal predecessors, (150), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:45:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2024-11-17 00:45:48,546 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 32 [2024-11-17 00:45:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:48,547 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2024-11-17 00:45:48,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:45:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2024-11-17 00:45:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:45:48,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:48,548 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:48,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:45:48,548 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:48,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1521586175, now seen corresponding path program 1 times [2024-11-17 00:45:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:48,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449502684] [2024-11-17 00:45:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:48,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:48,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:45:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:48,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449502684] [2024-11-17 00:45:48,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449502684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:48,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:48,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:45:48,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110530697] [2024-11-17 00:45:48,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:48,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:45:48,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:48,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:45:48,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:45:48,848 INFO L87 Difference]: Start difference. First operand 145 states and 160 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:45:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:49,126 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2024-11-17 00:45:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:45:49,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-17 00:45:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:49,127 INFO L225 Difference]: With dead ends: 144 [2024-11-17 00:45:49,127 INFO L226 Difference]: Without dead ends: 144 [2024-11-17 00:45:49,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:45:49,128 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 6 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:49,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 539 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:45:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-17 00:45:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-17 00:45:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 89 states have (on average 1.6741573033707866) internal successors, (149), 137 states have internal predecessors, (149), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:45:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2024-11-17 00:45:49,133 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 32 [2024-11-17 00:45:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:49,133 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2024-11-17 00:45:49,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:45:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2024-11-17 00:45:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:45:49,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:49,134 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] [2024-11-17 00:45:49,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:45:49,134 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:49,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:49,135 INFO L85 PathProgramCache]: Analyzing trace with hash 936228217, now seen corresponding path program 1 times [2024-11-17 00:45:49,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:49,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404127496] [2024-11-17 00:45:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:49,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:49,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-17 00:45:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 00:45:49,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:49,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404127496] [2024-11-17 00:45:49,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404127496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:49,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104249503] [2024-11-17 00:45:49,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:49,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:49,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:49,283 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-17 00:45:49,284 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-17 00:45:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:49,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:45:49,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:45:49,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:45:49,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104249503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:49,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:45:49,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-17 00:45:49,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579644567] [2024-11-17 00:45:49,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:49,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:45:49,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:49,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:45:49,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:45:49,491 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:45:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:49,506 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2024-11-17 00:45:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:45:49,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-17 00:45:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:49,507 INFO L225 Difference]: With dead ends: 124 [2024-11-17 00:45:49,507 INFO L226 Difference]: Without dead ends: 124 [2024-11-17 00:45:49,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:45:49,508 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:49,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:45:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-17 00:45:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-17 00:45:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 119 states have internal predecessors, (124), 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-17 00:45:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2024-11-17 00:45:49,512 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 43 [2024-11-17 00:45:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:49,512 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2024-11-17 00:45:49,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:45:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2024-11-17 00:45:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-17 00:45:49,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:49,513 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:49,529 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-17 00:45:49,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:49,714 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:49,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:49,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1903691938, now seen corresponding path program 1 times [2024-11-17 00:45:49,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:49,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192699035] [2024-11-17 00:45:49,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:49,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:49,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:50,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:50,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:45:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:45:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192699035] [2024-11-17 00:45:50,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192699035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372596688] [2024-11-17 00:45:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:50,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:50,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:50,184 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-17 00:45:50,186 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-17 00:45:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:50,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 00:45:50,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:50,383 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-17 00:45:50,390 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-17 00:45:50,414 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-17 00:45:50,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:45:50,452 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-17 00:45:50,464 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-17 00:45:50,486 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:45:50,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:45:50,540 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:45:50,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:45:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2024-11-17 00:45:50,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372596688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:50,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:45:50,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-11-17 00:45:50,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948691867] [2024-11-17 00:45:50,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:50,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:45:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:50,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:45:50,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2024-11-17 00:45:50,814 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:45:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:51,192 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2024-11-17 00:45:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:51,192 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2024-11-17 00:45:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:51,193 INFO L225 Difference]: With dead ends: 137 [2024-11-17 00:45:51,193 INFO L226 Difference]: Without dead ends: 137 [2024-11-17 00:45:51,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=186, Unknown=2, NotChecked=58, Total=306 [2024-11-17 00:45:51,194 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 105 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:51,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 285 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 370 Invalid, 0 Unknown, 272 Unchecked, 0.3s Time] [2024-11-17 00:45:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-17 00:45:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 116. [2024-11-17 00:45:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 111 states have internal predecessors, (116), 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-17 00:45:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2024-11-17 00:45:51,199 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 45 [2024-11-17 00:45:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:51,199 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2024-11-17 00:45:51,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:45:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2024-11-17 00:45:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-17 00:45:51,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:51,201 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:51,220 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-17 00:45:51,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:51,401 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:51,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1903691937, now seen corresponding path program 1 times [2024-11-17 00:45:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:51,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80212054] [2024-11-17 00:45:51,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:51,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:45:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 00:45:52,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:52,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80212054] [2024-11-17 00:45:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80212054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:52,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102021727] [2024-11-17 00:45:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:52,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:52,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:52,051 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-17 00:45:52,056 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-17 00:45:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:52,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:45:52,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:52,295 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-17 00:45:52,303 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-17 00:45:52,322 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-17 00:45:52,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:45:52,360 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-17 00:45:52,388 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-17 00:45:52,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:45:52,430 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-17 00:45:52,498 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-17 00:45:52,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:45:52,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:45:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-17 00:45:52,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:45:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102021727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:52,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:45:52,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-17 00:45:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233799362] [2024-11-17 00:45:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:52,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:45:52,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:52,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:45:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-17 00:45:52,548 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:45:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:52,713 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2024-11-17 00:45:52,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:52,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-11-17 00:45:52,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:52,715 INFO L225 Difference]: With dead ends: 111 [2024-11-17 00:45:52,715 INFO L226 Difference]: Without dead ends: 111 [2024-11-17 00:45:52,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-17 00:45:52,716 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 11 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:52,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 324 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 148 Unchecked, 0.1s Time] [2024-11-17 00:45:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-17 00:45:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-17 00:45:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.5) internal successors, (111), 106 states have internal predecessors, (111), 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-17 00:45:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2024-11-17 00:45:52,721 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 45 [2024-11-17 00:45:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:52,722 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2024-11-17 00:45:52,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:45:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2024-11-17 00:45:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:45:52,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:52,723 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:45:52,742 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-17 00:45:52,923 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,SelfDestructingSolverStorable14 [2024-11-17 00:45:52,923 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:52,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2138299023, now seen corresponding path program 1 times [2024-11-17 00:45:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:52,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81406756] [2024-11-17 00:45:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:53,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:53,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:45:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-17 00:45:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:53,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81406756] [2024-11-17 00:45:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81406756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:53,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:45:53,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:45:53,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843372455] [2024-11-17 00:45:53,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:53,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:45:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:53,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:45:53,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:45:53,078 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:45:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:53,268 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2024-11-17 00:45:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:45:53,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-17 00:45:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:53,269 INFO L225 Difference]: With dead ends: 107 [2024-11-17 00:45:53,269 INFO L226 Difference]: Without dead ends: 107 [2024-11-17 00:45:53,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:45:53,270 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 18 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:53,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 351 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:45:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-17 00:45:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-17 00:45:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.445945945945946) internal successors, (107), 102 states have internal predecessors, (107), 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-17 00:45:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2024-11-17 00:45:53,273 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 48 [2024-11-17 00:45:53,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:53,274 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2024-11-17 00:45:53,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:45:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2024-11-17 00:45:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:45:53,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:53,275 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:45:53,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:45:53,275 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:53,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2138299022, now seen corresponding path program 1 times [2024-11-17 00:45:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:53,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10228009] [2024-11-17 00:45:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:53,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:53,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:53,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:45:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:45:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10228009] [2024-11-17 00:45:53,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10228009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596382205] [2024-11-17 00:45:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:53,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:53,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:53,591 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-17 00:45:53,593 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-17 00:45:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:53,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:45:53,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 00:45:53,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:45:53,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596382205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:45:53,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:45:53,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-11-17 00:45:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004449507] [2024-11-17 00:45:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:45:53,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:45:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:53,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:45:53,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:45:53,932 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:45:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:54,088 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2024-11-17 00:45:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:45:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-17 00:45:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:54,089 INFO L225 Difference]: With dead ends: 103 [2024-11-17 00:45:54,089 INFO L226 Difference]: Without dead ends: 103 [2024-11-17 00:45:54,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:45:54,090 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:54,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 413 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:45:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-17 00:45:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-17 00:45:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 98 states have internal predecessors, (103), 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-17 00:45:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2024-11-17 00:45:54,093 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 48 [2024-11-17 00:45:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:54,094 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2024-11-17 00:45:54,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:45:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2024-11-17 00:45:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:45:54,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:54,095 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:45:54,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-17 00:45:54,295 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,SelfDestructingSolverStorable16 [2024-11-17 00:45:54,296 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:54,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2138271219, now seen corresponding path program 1 times [2024-11-17 00:45:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:54,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314552685] [2024-11-17 00:45:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:54,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:54,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:54,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:45:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:45:54,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:54,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314552685] [2024-11-17 00:45:54,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314552685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:54,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54609350] [2024-11-17 00:45:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:54,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:54,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:54,705 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-17 00:45:54,707 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-17 00:45:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:55,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-17 00:45:55,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:55,371 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-17 00:45:55,374 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-17 00:45:55,567 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-17 00:45:55,574 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:45:55,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:45:55,651 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-17 00:45:55,670 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-17 00:45:55,726 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-17 00:45:55,727 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-17 00:45:55,755 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-17 00:45:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-17 00:45:55,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54609350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:55,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:45:55,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2024-11-17 00:45:55,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301139107] [2024-11-17 00:45:55,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:55,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:45:55,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:55,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:45:55,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=583, Unknown=1, NotChecked=48, Total=702 [2024-11-17 00:45:55,819 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 26 states, 25 states have (on average 3.2) internal successors, (80), 21 states have internal predecessors, (80), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:45:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:56,563 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2024-11-17 00:45:56,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:45:56,564 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.2) internal successors, (80), 21 states have internal predecessors, (80), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2024-11-17 00:45:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:56,565 INFO L225 Difference]: With dead ends: 102 [2024-11-17 00:45:56,565 INFO L226 Difference]: Without dead ends: 102 [2024-11-17 00:45:56,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=1060, Unknown=1, NotChecked=66, Total=1260 [2024-11-17 00:45:56,566 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 68 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:56,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 850 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1152 Invalid, 0 Unknown, 100 Unchecked, 0.6s Time] [2024-11-17 00:45:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-17 00:45:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-17 00:45:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 97 states have internal predecessors, (102), 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-17 00:45:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2024-11-17 00:45:56,570 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 48 [2024-11-17 00:45:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:56,570 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2024-11-17 00:45:56,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.2) internal successors, (80), 21 states have internal predecessors, (80), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:45:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2024-11-17 00:45:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:45:56,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:56,571 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:45:56,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-17 00:45:56,772 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,SelfDestructingSolverStorable17 [2024-11-17 00:45:56,772 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:56,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2138271218, now seen corresponding path program 1 times [2024-11-17 00:45:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:56,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010891124] [2024-11-17 00:45:56,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:56,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:57,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:45:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:45:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010891124] [2024-11-17 00:45:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010891124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116441925] [2024-11-17 00:45:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:57,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:57,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:57,387 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-17 00:45:57,389 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-17 00:45:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:57,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-17 00:45:57,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:45:57,831 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-17 00:45:58,055 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-17 00:45:58,167 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:45:58,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-17 00:45:58,229 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-17 00:45:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:45:58,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:45:58,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116441925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:58,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:45:58,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2024-11-17 00:45:58,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455621753] [2024-11-17 00:45:58,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:45:58,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:45:58,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:45:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:45:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2024-11-17 00:45:58,398 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 26 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:45:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:45:59,200 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2024-11-17 00:45:59,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 00:45:59,200 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2024-11-17 00:45:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:45:59,201 INFO L225 Difference]: With dead ends: 109 [2024-11-17 00:45:59,201 INFO L226 Difference]: Without dead ends: 109 [2024-11-17 00:45:59,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=1482, Unknown=0, NotChecked=0, Total=1640 [2024-11-17 00:45:59,202 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:45:59,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1017 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:45:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-17 00:45:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-17 00:45:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 103 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-17 00:45:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2024-11-17 00:45:59,206 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 48 [2024-11-17 00:45:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:45:59,207 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2024-11-17 00:45:59,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:45:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2024-11-17 00:45:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-17 00:45:59,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:45:59,208 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:45:59,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-17 00:45:59,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:59,409 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:45:59,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:45:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash 888780758, now seen corresponding path program 1 times [2024-11-17 00:45:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:45:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905375726] [2024-11-17 00:45:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:45:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:59,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:45:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:59,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:45:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:59,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:45:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:45:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:45:59,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:45:59,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905375726] [2024-11-17 00:45:59,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905375726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:45:59,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618599636] [2024-11-17 00:45:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:45:59,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:45:59,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:45:59,748 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-17 00:45:59,759 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-17 00:46:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:00,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 00:46:00,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:00,058 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-17 00:46:00,064 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-17 00:46:00,091 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-17 00:46:00,094 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-17 00:46:00,111 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-17 00:46:00,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:00,147 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-17 00:46:00,154 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:46:00,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:46:00,201 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-17 00:46:00,220 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-17 00:46:00,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:00,252 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-17 00:46:00,304 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-17 00:46:00,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:00,344 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-17 00:46:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2024-11-17 00:46:00,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618599636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:00,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2024-11-17 00:46:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396064994] [2024-11-17 00:46:00,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:00,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 00:46:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 00:46:00,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=263, Unknown=2, NotChecked=66, Total=380 [2024-11-17 00:46:00,487 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 18 states, 17 states have (on average 4.352941176470588) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:46:00,509 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|)))) is different from true [2024-11-17 00:46:00,512 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|)))) is different from true [2024-11-17 00:46:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:00,760 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2024-11-17 00:46:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:46:00,761 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.352941176470588) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2024-11-17 00:46:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:00,762 INFO L225 Difference]: With dead ends: 103 [2024-11-17 00:46:00,762 INFO L226 Difference]: Without dead ends: 103 [2024-11-17 00:46:00,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=511, Unknown=4, NotChecked=196, Total=812 [2024-11-17 00:46:00,763 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 43 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:00,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 718 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 384 Invalid, 0 Unknown, 309 Unchecked, 0.2s Time] [2024-11-17 00:46:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-17 00:46:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-17 00:46:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.294871794871795) internal successors, (101), 97 states have internal predecessors, (101), 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-17 00:46:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2024-11-17 00:46:00,766 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 51 [2024-11-17 00:46:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:00,766 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2024-11-17 00:46:00,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.352941176470588) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:46:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2024-11-17 00:46:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:46:00,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:00,767 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:00,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:00,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:00,968 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:46:00,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1645073252, now seen corresponding path program 1 times [2024-11-17 00:46:00,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:00,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849983983] [2024-11-17 00:46:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:00,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:46:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-17 00:46:01,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:01,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849983983] [2024-11-17 00:46:01,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849983983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:01,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:01,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:46:01,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259268243] [2024-11-17 00:46:01,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:01,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:46:01,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:01,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:46:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:46:01,112 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:46:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:01,235 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2024-11-17 00:46:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:46:01,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-17 00:46:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:01,236 INFO L225 Difference]: With dead ends: 102 [2024-11-17 00:46:01,236 INFO L226 Difference]: Without dead ends: 102 [2024-11-17 00:46:01,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:46:01,237 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:01,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 384 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-17 00:46:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-17 00:46:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 96 states have internal predecessors, (100), 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-17 00:46:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2024-11-17 00:46:01,240 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 54 [2024-11-17 00:46:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:01,240 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2024-11-17 00:46:01,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:46:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2024-11-17 00:46:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:46:01,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:01,241 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:01,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 00:46:01,241 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:46:01,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1645073253, now seen corresponding path program 1 times [2024-11-17 00:46:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:01,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912193026] [2024-11-17 00:46:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:46:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:01,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:01,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912193026] [2024-11-17 00:46:01,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912193026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:01,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555422571] [2024-11-17 00:46:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:01,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:01,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:01,679 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:01,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-17 00:46:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:01,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 00:46:01,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:02,029 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 23 treesize of output 15 [2024-11-17 00:46:02,032 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 28 treesize of output 16 [2024-11-17 00:46:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-17 00:46:02,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:46:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555422571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:02,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:46:02,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-17 00:46:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861105885] [2024-11-17 00:46:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:02,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:46:02,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:02,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:46:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-17 00:46:02,084 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:46:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:02,209 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2024-11-17 00:46:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:46:02,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-17 00:46:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:02,211 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:46:02,211 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:46:02,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:46:02,212 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:02,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 361 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:46:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-17 00:46:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 95 states have internal predecessors, (99), 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-17 00:46:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2024-11-17 00:46:02,215 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 54 [2024-11-17 00:46:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:02,215 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2024-11-17 00:46:02,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:46:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2024-11-17 00:46:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-17 00:46:02,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:02,216 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:02,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-17 00:46:02,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-17 00:46:02,417 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:46:02,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:02,417 INFO L85 PathProgramCache]: Analyzing trace with hash -542336685, now seen corresponding path program 1 times [2024-11-17 00:46:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516989851] [2024-11-17 00:46:02,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:02,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:03,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:46:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:46:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516989851] [2024-11-17 00:46:03,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516989851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248492885] [2024-11-17 00:46:03,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:03,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:03,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:03,574 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:03,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-17 00:46:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:03,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-17 00:46:03,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:03,892 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 19 treesize of output 1 [2024-11-17 00:46:03,979 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 19 treesize of output 5 [2024-11-17 00:46:03,985 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:46:03,985 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-17 00:46:04,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:04,083 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 28 treesize of output 23 [2024-11-17 00:46:04,113 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2024-11-17 00:46:04,113 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 42 treesize of output 64 [2024-11-17 00:46:04,195 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 45 treesize of output 33 [2024-11-17 00:46:04,240 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 43 treesize of output 13 [2024-11-17 00:46:04,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-17 00:46:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:46:04,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:04,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248492885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:04,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:04,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 33 [2024-11-17 00:46:04,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030916237] [2024-11-17 00:46:04,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:04,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-17 00:46:04,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:04,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-17 00:46:04,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1438, Unknown=0, NotChecked=0, Total=1560 [2024-11-17 00:46:04,716 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 34 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 30 states have internal predecessors, (76), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-17 00:46:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:05,566 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-11-17 00:46:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:46:05,566 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 30 states have internal predecessors, (76), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 55 [2024-11-17 00:46:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:05,567 INFO L225 Difference]: With dead ends: 100 [2024-11-17 00:46:05,567 INFO L226 Difference]: Without dead ends: 100 [2024-11-17 00:46:05,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=2147, Unknown=0, NotChecked=0, Total=2352 [2024-11-17 00:46:05,568 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:05,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1113 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:46:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-17 00:46:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-17 00:46:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 94 states have internal predecessors, (98), 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-17 00:46:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2024-11-17 00:46:05,571 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 55 [2024-11-17 00:46:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:05,572 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2024-11-17 00:46:05,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 30 states have internal predecessors, (76), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-17 00:46:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2024-11-17 00:46:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-17 00:46:05,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:05,572 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:05,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:05,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:05,773 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:46:05,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash -542336684, now seen corresponding path program 1 times [2024-11-17 00:46:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835339842] [2024-11-17 00:46:05,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:06,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:46:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:46:07,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:07,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835339842] [2024-11-17 00:46:07,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835339842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:07,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254885583] [2024-11-17 00:46:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:07,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:07,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:07,397 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:07,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-17 00:46:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:07,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-17 00:46:07,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:07,782 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-17 00:46:07,979 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-17 00:46:07,985 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-17 00:46:08,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-11-17 00:46:08,132 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 27 treesize of output 11 [2024-11-17 00:46:08,146 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:46:08,146 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-17 00:46:08,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:08,396 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 45 treesize of output 34 [2024-11-17 00:46:08,418 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-17 00:46:08,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-17 00:46:08,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-17 00:46:08,432 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 43 treesize of output 32 [2024-11-17 00:46:08,599 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:46:08,599 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 15 treesize of output 7 [2024-11-17 00:46:08,648 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 35 treesize of output 19 [2024-11-17 00:46:08,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-11-17 00:46:08,723 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 7 treesize of output 3 [2024-11-17 00:46:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:46:08,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:09,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254885583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:09,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:09,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2024-11-17 00:46:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167692712] [2024-11-17 00:46:09,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:09,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-17 00:46:09,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:09,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-17 00:46:09,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2204, Unknown=0, NotChecked=0, Total=2352 [2024-11-17 00:46:09,150 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 44 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 37 states have internal predecessors, (90), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:10,859 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2024-11-17 00:46:10,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 00:46:10,859 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 37 states have internal predecessors, (90), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2024-11-17 00:46:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:10,860 INFO L225 Difference]: With dead ends: 99 [2024-11-17 00:46:10,860 INFO L226 Difference]: Without dead ends: 99 [2024-11-17 00:46:10,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=239, Invalid=3421, Unknown=0, NotChecked=0, Total=3660 [2024-11-17 00:46:10,861 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:10,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1558 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 00:46:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-17 00:46:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-17 00:46:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 93 states have internal predecessors, (97), 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-17 00:46:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2024-11-17 00:46:10,864 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 55 [2024-11-17 00:46:10,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:10,864 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2024-11-17 00:46:10,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 37 states have internal predecessors, (90), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2024-11-17 00:46:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-17 00:46:10,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:10,865 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:10,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:11,066 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:46:11,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1061745294, now seen corresponding path program 1 times [2024-11-17 00:46:11,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:11,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792329200] [2024-11-17 00:46:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:11,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:11,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:46:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-17 00:46:11,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792329200] [2024-11-17 00:46:11,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792329200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:11,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:46:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264660454] [2024-11-17 00:46:11,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:11,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:46:11,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:46:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:46:11,412 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:46:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:11,628 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2024-11-17 00:46:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:46:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2024-11-17 00:46:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:11,629 INFO L225 Difference]: With dead ends: 104 [2024-11-17 00:46:11,630 INFO L226 Difference]: Without dead ends: 104 [2024-11-17 00:46:11,630 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-17 00:46:11,630 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:11,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 439 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:46:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-17 00:46:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-11-17 00:46:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.2375) internal successors, (99), 94 states have internal predecessors, (99), 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-17 00:46:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-17 00:46:11,633 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 62 [2024-11-17 00:46:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:11,633 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-17 00:46:11,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:46:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-17 00:46:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-17 00:46:11,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:11,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:11,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 00:46:11,634 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:46:11,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1061745293, now seen corresponding path program 1 times [2024-11-17 00:46:11,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:11,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970017215] [2024-11-17 00:46:11,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:11,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:46:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 00:46:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:12,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970017215] [2024-11-17 00:46:12,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970017215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:12,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:12,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:46:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44516322] [2024-11-17 00:46:12,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:12,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:46:12,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:12,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:46:12,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:46:12,159 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:46:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:12,421 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2024-11-17 00:46:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:46:12,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2024-11-17 00:46:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:12,422 INFO L225 Difference]: With dead ends: 106 [2024-11-17 00:46:12,422 INFO L226 Difference]: Without dead ends: 106 [2024-11-17 00:46:12,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-17 00:46:12,423 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 33 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:12,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 544 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:46:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-17 00:46:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-11-17 00:46:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 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-17 00:46:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-17 00:46:12,428 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 62 [2024-11-17 00:46:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:12,429 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-17 00:46:12,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:46:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-17 00:46:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-17 00:46:12,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:12,430 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:12,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 00:46:12,431 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:46:12,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1253828959, now seen corresponding path program 1 times [2024-11-17 00:46:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562472193] [2024-11-17 00:46:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:12,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:14,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:14,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:46:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:46:14,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562472193] [2024-11-17 00:46:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562472193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765849968] [2024-11-17 00:46:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:14,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:14,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:14,774 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:14,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-17 00:46:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:15,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-17 00:46:15,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:15,423 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 19 treesize of output 1 [2024-11-17 00:46:15,564 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 19 treesize of output 5 [2024-11-17 00:46:15,568 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:46:15,568 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-17 00:46:15,679 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-17 00:46:15,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:15,788 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 28 treesize of output 23 [2024-11-17 00:46:15,804 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2024-11-17 00:46:15,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2024-11-17 00:46:16,123 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:16,127 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2024-11-17 00:46:16,128 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 1 case distinctions, treesize of input 36 treesize of output 11 [2024-11-17 00:46:16,432 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:16,433 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-17 00:46:16,444 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-17 00:46:16,548 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 25 treesize of output 13 [2024-11-17 00:46:16,574 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 18 treesize of output 13 [2024-11-17 00:46:16,702 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 18 treesize of output 13 [2024-11-17 00:46:16,820 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 0 case distinctions, treesize of input 57 treesize of output 21 [2024-11-17 00:46:16,949 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:16,951 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-17 00:46:16,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:16,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:16,957 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 21 treesize of output 16 [2024-11-17 00:46:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:46:17,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:18,116 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 Int) (v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4630))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2024-11-17 00:46:18,134 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4630)) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4626 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_4626)))) is different from false [2024-11-17 00:46:18,156 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4630)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4626 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_4626)))) is different from false [2024-11-17 00:46:18,179 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4630)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4626 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_4626)))) is different from false [2024-11-17 00:46:18,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4626) .cse0 v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4630))) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4626 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_4626)))) is different from false [2024-11-17 00:46:18,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4626) .cse0 v_ArrVal_4628) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4630))) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4626 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_4626)))) is different from false [2024-11-17 00:46:18,248 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4)))) (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_4628) .cse1 v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4626) .cse0 v_ArrVal_4628) .cse1 v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4630))) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4626 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_4626)))) is different from false [2024-11-17 00:46:18,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_4628) .cse1 v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4626) .cse0 v_ArrVal_4628) .cse1 v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4630)))) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_4626 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_4626)))) is different from false [2024-11-17 00:46:18,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:18,670 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 4154 treesize of output 4144 [2024-11-17 00:46:18,697 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 1306 treesize of output 1226 [2024-11-17 00:46:18,750 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 1546 treesize of output 1386 [2024-11-17 00:46:18,799 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 19 treesize of output 3 [2024-11-17 00:46:19,270 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 1667 treesize of output 1603 [2024-11-17 00:46:19,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765849968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:19,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:19,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 59 [2024-11-17 00:46:19,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453023721] [2024-11-17 00:46:19,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:19,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-17 00:46:19,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:19,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-17 00:46:19,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4188, Unknown=37, NotChecked=1096, Total=5550 [2024-11-17 00:46:19,981 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 59 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 54 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:22,358 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2024-11-17 00:46:22,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-17 00:46:22,359 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 54 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 66 [2024-11-17 00:46:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:22,360 INFO L225 Difference]: With dead ends: 106 [2024-11-17 00:46:22,360 INFO L226 Difference]: Without dead ends: 106 [2024-11-17 00:46:22,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=443, Invalid=7922, Unknown=39, NotChecked=1496, Total=9900 [2024-11-17 00:46:22,363 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 88 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:22,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1801 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:46:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-17 00:46:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-11-17 00:46:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 96 states have internal predecessors, (100), 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-17 00:46:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2024-11-17 00:46:22,366 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 66 [2024-11-17 00:46:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:22,367 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2024-11-17 00:46:22,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 54 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2024-11-17 00:46:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-17 00:46:22,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:22,368 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:22,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:22,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-17 00:46:22,572 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:46:22,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1677096615, now seen corresponding path program 1 times [2024-11-17 00:46:22,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:22,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108128492] [2024-11-17 00:46:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:22,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:46:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:46:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108128492] [2024-11-17 00:46:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108128492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210597739] [2024-11-17 00:46:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:24,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:24,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:24,329 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:24,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-17 00:46:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-17 00:46:24,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:24,758 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-17 00:46:24,942 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 19 treesize of output 1 [2024-11-17 00:46:25,072 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 19 treesize of output 5 [2024-11-17 00:46:25,077 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:46:25,077 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-17 00:46:25,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:25,254 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 28 treesize of output 23 [2024-11-17 00:46:25,271 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2024-11-17 00:46:25,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2024-11-17 00:46:26,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:26,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 47 [2024-11-17 00:46:26,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:26,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-17 00:46:26,135 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 31 treesize of output 24 [2024-11-17 00:46:26,253 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-17 00:46:26,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 48 [2024-11-17 00:46:26,262 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 16 treesize of output 8 [2024-11-17 00:46:26,355 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 26 treesize of output 19 [2024-11-17 00:46:26,372 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 77 treesize of output 29 [2024-11-17 00:46:26,456 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 67 treesize of output 43 [2024-11-17 00:46:26,458 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 47 treesize of output 31 [2024-11-17 00:46:26,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:26,567 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 35 treesize of output 17 [2024-11-17 00:46:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:46:26,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:26,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4941 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4941))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-17 00:46:26,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4940 (Array Int Int)) (v_ArrVal_4941 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4941))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-17 00:46:26,817 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4940 (Array Int Int)) (v_ArrVal_4941 (Array Int Int))) (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-17 00:46:26,828 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4940 (Array Int Int)) (v_ArrVal_4941 (Array Int Int))) (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-17 00:46:26,840 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4940 (Array Int Int)) (v_ArrVal_4941 (Array Int Int))) (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-17 00:46:26,853 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4940 (Array Int Int)) (v_ArrVal_4941 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-17 00:46:26,866 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4940 (Array Int Int)) (v_ArrVal_4941 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_4940) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base|))) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-17 00:46:26,885 INFO L349 Elim1Store]: treesize reduction 5, result has 94.8 percent of original size [2024-11-17 00:46:26,886 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 100 treesize of output 99 [2024-11-17 00:46:26,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4940 (Array Int Int)) (v_ArrVal_4941 (Array Int Int))) (= (select (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4)))) (store (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4940) .cse1 v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_4940) .cse1 v_ArrVal_4941) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) .cse1))) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|)) is different from false [2024-11-17 00:46:27,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210597739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:27,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:27,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 56 [2024-11-17 00:46:27,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422986625] [2024-11-17 00:46:27,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:27,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-17 00:46:27,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:27,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-17 00:46:27,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=3897, Unknown=40, NotChecked=1064, Total=5256 [2024-11-17 00:46:27,874 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 57 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 51 states have internal predecessors, (111), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:29,099 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2024-11-17 00:46:29,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-17 00:46:29,099 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 51 states have internal predecessors, (111), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2024-11-17 00:46:29,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:29,100 INFO L225 Difference]: With dead ends: 111 [2024-11-17 00:46:29,100 INFO L226 Difference]: Without dead ends: 111 [2024-11-17 00:46:29,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=346, Invalid=5343, Unknown=43, NotChecked=1240, Total=6972 [2024-11-17 00:46:29,102 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 67 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:29,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1283 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:46:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-17 00:46:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2024-11-17 00:46:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 101 states have internal predecessors, (107), 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-17 00:46:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2024-11-17 00:46:29,105 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 69 [2024-11-17 00:46:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:29,105 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2024-11-17 00:46:29,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 51 states have internal predecessors, (111), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2024-11-17 00:46:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-17 00:46:29,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:29,106 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:29,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-17 00:46:29,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-17 00:46:29,306 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:46:29,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1677096616, now seen corresponding path program 1 times [2024-11-17 00:46:29,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:29,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966151666] [2024-11-17 00:46:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:31,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:46:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:46:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966151666] [2024-11-17 00:46:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966151666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361044812] [2024-11-17 00:46:31,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:31,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:31,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:31,668 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:31,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-17 00:46:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:32,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 135 conjuncts are in the unsatisfiable core [2024-11-17 00:46:32,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:32,077 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-17 00:46:32,428 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-17 00:46:32,594 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-17 00:46:32,600 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:46:32,600 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-17 00:46:32,605 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-17 00:46:32,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:32,939 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-17 00:46:32,952 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-17 00:46:32,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-17 00:46:32,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-17 00:46:33,935 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:33,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-11-17 00:46:33,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:33,962 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-17 00:46:33,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 33 [2024-11-17 00:46:34,128 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 11 treesize of output 7 [2024-11-17 00:46:34,144 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 22 [2024-11-17 00:46:34,261 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-17 00:46:34,262 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 61 treesize of output 50 [2024-11-17 00:46:34,265 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-17 00:46:34,273 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 24 treesize of output 11 [2024-11-17 00:46:34,379 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 26 treesize of output 19 [2024-11-17 00:46:34,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:46:34,407 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 57 treesize of output 25 [2024-11-17 00:46:34,419 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 39 treesize of output 15 [2024-11-17 00:46:34,536 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 64 treesize of output 36 [2024-11-17 00:46:34,779 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 33 treesize of output 17 [2024-11-17 00:46:34,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 00:46:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:46:34,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:35,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5255 (Array Int Int)) (v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5256 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (<= (+ 12 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5254) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5256))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse2) .cse3)) (select |c_#length| (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5253) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5255))) (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse2) .cse3)))) (forall ((v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5256 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (<= 0 (+ 8 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5254) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5256))) (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse2) .cse3)))))) is different from false [2024-11-17 00:46:35,677 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2024-11-17 00:46:35,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1330 treesize of output 1284 [2024-11-17 00:46:35,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:35,694 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 2598 treesize of output 2586 [2024-11-17 00:46:35,714 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 1684 treesize of output 1654 [2024-11-17 00:46:35,730 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 2182 treesize of output 2122 [2024-11-17 00:46:36,080 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 55 treesize of output 49 [2024-11-17 00:46:36,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:36,311 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 336 treesize of output 328 [2024-11-17 00:46:36,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:36,368 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:36,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:36,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:36,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2024-11-17 00:46:36,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:36,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:36,379 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 27 treesize of output 23 [2024-11-17 00:46:36,382 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:36,384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-17 00:46:39,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361044812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:39,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:39,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 34] total 60 [2024-11-17 00:46:39,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101555148] [2024-11-17 00:46:39,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:39,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-17 00:46:39,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:39,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-17 00:46:39,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=5698, Unknown=35, NotChecked=152, Total=6162 [2024-11-17 00:46:39,409 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 61 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 55 states have internal predecessors, (117), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:42,503 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2024-11-17 00:46:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-17 00:46:42,503 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 55 states have internal predecessors, (117), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2024-11-17 00:46:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:42,504 INFO L225 Difference]: With dead ends: 113 [2024-11-17 00:46:42,504 INFO L226 Difference]: Without dead ends: 113 [2024-11-17 00:46:42,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2118 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=484, Invalid=9182, Unknown=40, NotChecked=194, Total=9900 [2024-11-17 00:46:42,507 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 97 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 2284 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:42,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1885 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2284 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 00:46:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-17 00:46:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-17 00:46:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 103 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-17 00:46:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2024-11-17 00:46:42,510 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 69 [2024-11-17 00:46:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:42,510 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2024-11-17 00:46:42,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 55 states have internal predecessors, (117), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2024-11-17 00:46:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-17 00:46:42,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:42,512 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:42,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:42,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-17 00:46:42,712 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2024-11-17 00:46:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1075632354, now seen corresponding path program 1 times [2024-11-17 00:46:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811543277] [2024-11-17 00:46:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:43,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:46:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:46:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 00:46:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:46:44,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:44,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811543277] [2024-11-17 00:46:44,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811543277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:44,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479483635] [2024-11-17 00:46:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:44,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:44,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:44,206 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:44,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-17 00:46:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:44,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-17 00:46:44,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:44,775 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 19 treesize of output 1 [2024-11-17 00:46:44,914 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 19 treesize of output 5 [2024-11-17 00:46:44,918 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:46:44,918 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-17 00:46:45,024 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2024-11-17 00:46:45,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2024-11-17 00:46:45,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:45,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-11-17 00:46:45,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:45,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-17 00:46:45,717 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 31 treesize of output 24 [2024-11-17 00:46:45,808 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-17 00:46:45,808 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 38 treesize of output 33 [2024-11-17 00:46:45,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 00:46:45,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-17 00:46:45,885 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 60 treesize of output 24 [2024-11-17 00:46:45,951 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 38 [2024-11-17 00:46:46,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:46,090 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 46 treesize of output 20 [2024-11-17 00:46:46,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-17 00:46:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:46:46,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:46,260 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5569 (Array Int Int))) (not (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5569))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) is different from false [2024-11-17 00:46:46,267 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5569 (Array Int Int)) (v_ArrVal_5568 (Array Int Int))) (not (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5569))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) is different from false [2024-11-17 00:46:46,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5569 (Array Int Int)) (v_ArrVal_5568 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))) is different from false [2024-11-17 00:46:46,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5569 (Array Int Int)) (v_ArrVal_5568 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))) is different from false [2024-11-17 00:46:46,290 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5569 (Array Int Int)) (v_ArrVal_5568 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))) is different from false [2024-11-17 00:46:46,300 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5569 (Array Int Int)) (v_ArrVal_5568 (Array Int Int))) (not (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse2) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2))))) is different from false [2024-11-17 00:46:46,310 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5569 (Array Int Int)) (v_ArrVal_5568 (Array Int Int))) (not (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_ArrVal_5568) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base|))) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-11-17 00:46:46,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5569 (Array Int Int)) (v_ArrVal_5568 (Array Int Int))) (not (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4)))) (store (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_5568) .cse1 v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_5568) .cse1 v_ArrVal_5569) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) .cse1))) .cse3) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3))))) is different from false [2024-11-17 00:46:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479483635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:46,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:46,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 58 [2024-11-17 00:46:46,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064092217] [2024-11-17 00:46:46,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:46,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-17 00:46:46,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:46,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-17 00:46:46,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=3656, Unknown=47, NotChecked=1032, Total=4970 [2024-11-17 00:46:46,949 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 58 states, 56 states have (on average 1.875) internal successors, (105), 53 states have internal predecessors, (105), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:48,924 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2024-11-17 00:46:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-17 00:46:48,925 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.875) internal successors, (105), 53 states have internal predecessors, (105), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 71 [2024-11-17 00:46:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:48,925 INFO L225 Difference]: With dead ends: 113 [2024-11-17 00:46:48,926 INFO L226 Difference]: Without dead ends: 113 [2024-11-17 00:46:48,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=415, Invalid=6875, Unknown=52, NotChecked=1400, Total=8742 [2024-11-17 00:46:48,927 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 60 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:48,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2238 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 00:46:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-17 00:46:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-17 00:46:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 103 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-17 00:46:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2024-11-17 00:46:48,930 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 71 [2024-11-17 00:46:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:48,930 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2024-11-17 00:46:48,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.875) internal successors, (105), 53 states have internal predecessors, (105), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:46:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2024-11-17 00:46:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 00:46:48,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:48,931 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:48,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0