./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:27:27,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:27:27,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:27:27,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:27:27,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:27:27,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:27:27,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:27:27,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:27:27,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:27:27,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:27:27,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:27:27,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:27:27,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:27:27,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:27:27,919 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:27:27,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:27:27,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:27:27,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:27:27,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:27:27,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:27:27,924 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:27:27,925 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:27:27,926 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:27:27,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:27:27,926 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:27:27,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:27:27,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:27:27,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:27:27,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:27:27,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:27:27,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:27:27,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:27:27,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:27:27,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:27:27,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:27:27,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:27:27,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:27:27,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:27:27,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:27:27,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:27:27,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:27:27,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:27:27,931 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2024-11-10 15:27:28,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:27:28,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:27:28,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:27:28,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:27:28,215 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:27:28,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-10 15:27:29,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:27:29,820 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:27:29,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-10 15:27:29,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28632f99a/7b45e239fa424214b9bba90d7650abe2/FLAG3795e2b25 [2024-11-10 15:27:29,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28632f99a/7b45e239fa424214b9bba90d7650abe2 [2024-11-10 15:27:29,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:27:29,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:27:29,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:27:29,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:27:29,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:27:29,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:27:29" (1/1) ... [2024-11-10 15:27:29,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d5ccdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:29, skipping insertion in model container [2024-11-10 15:27:29,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:27:29" (1/1) ... [2024-11-10 15:27:29,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:27:30,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:27:30,277 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:27:30,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:27:30,369 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:27:30,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30 WrapperNode [2024-11-10 15:27:30,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:27:30,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:27:30,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:27:30,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:27:30,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,422 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 168 [2024-11-10 15:27:30,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:27:30,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:27:30,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:27:30,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:27:30,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,479 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 21, 8]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2024-11-10 15:27:30,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:27:30,516 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:27:30,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:27:30,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:27:30,517 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (1/1) ... [2024-11-10 15:27:30,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:27:30,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:30,555 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:27:30,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:27:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-10 15:27:30,605 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-10 15:27:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:27:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:27:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 15:27:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:27:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:27:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 15:27:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:27:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:27:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:27:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:27:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:27:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:27:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:27:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:27:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:27:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:27:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:27:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:27:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 15:27:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:27:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:27:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:27:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:27:30,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:27:30,761 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:27:30,764 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:27:30,789 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-10 15:27:31,137 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L637: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-10 15:27:31,167 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-10 15:27:31,168 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:27:31,186 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:27:31,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:27:31,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:27:31 BoogieIcfgContainer [2024-11-10 15:27:31,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:27:31,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:27:31,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:27:31,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:27:31,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:27:29" (1/3) ... [2024-11-10 15:27:31,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca436c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:27:31, skipping insertion in model container [2024-11-10 15:27:31,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:30" (2/3) ... [2024-11-10 15:27:31,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca436c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:27:31, skipping insertion in model container [2024-11-10 15:27:31,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:27:31" (3/3) ... [2024-11-10 15:27:31,197 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2024-11-10 15:27:31,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:27:31,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2024-11-10 15:27:31,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:27:31,265 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;@4b05d04d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:27:31,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-10 15:27:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 81 states have (on average 2.0123456790123457) internal successors, (163), 143 states have internal predecessors, (163), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:27:31,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:31,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:27:31,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:31,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1975708379, now seen corresponding path program 1 times [2024-11-10 15:27:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:31,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467667008] [2024-11-10 15:27:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:31,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:31,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467667008] [2024-11-10 15:27:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467667008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:31,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:31,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:27:31,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680772810] [2024-11-10 15:27:31,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:31,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:27:31,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:31,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:27:31,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:31,563 INFO L87 Difference]: Start difference. First operand has 145 states, 81 states have (on average 2.0123456790123457) internal successors, (163), 143 states have internal predecessors, (163), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:31,734 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2024-11-10 15:27:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:27:31,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 15:27:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:31,747 INFO L225 Difference]: With dead ends: 141 [2024-11-10 15:27:31,747 INFO L226 Difference]: Without dead ends: 134 [2024-11-10 15:27:31,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:31,754 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:31,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 223 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-10 15:27:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-10 15:27:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 133 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2024-11-10 15:27:31,827 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 6 [2024-11-10 15:27:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:31,828 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2024-11-10 15:27:31,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2024-11-10 15:27:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:27:31,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:31,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:27:31,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:27:31,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:31,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1975708380, now seen corresponding path program 1 times [2024-11-10 15:27:31,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:31,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268423890] [2024-11-10 15:27:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:31,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268423890] [2024-11-10 15:27:32,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268423890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:32,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:32,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:27:32,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212632525] [2024-11-10 15:27:32,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:32,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:27:32,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:32,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:27:32,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:32,042 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:32,158 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2024-11-10 15:27:32,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:27:32,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 15:27:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:32,160 INFO L225 Difference]: With dead ends: 131 [2024-11-10 15:27:32,162 INFO L226 Difference]: Without dead ends: 131 [2024-11-10 15:27:32,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:32,163 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:32,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 215 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-10 15:27:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-10 15:27:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 76 states have (on average 1.868421052631579) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2024-11-10 15:27:32,174 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 6 [2024-11-10 15:27:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:32,174 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2024-11-10 15:27:32,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2024-11-10 15:27:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:27:32,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:32,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:32,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:27:32,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:32,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:32,176 INFO L85 PathProgramCache]: Analyzing trace with hash 277813623, now seen corresponding path program 1 times [2024-11-10 15:27:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:32,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316667699] [2024-11-10 15:27:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316667699] [2024-11-10 15:27:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316667699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:32,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:27:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714934495] [2024-11-10 15:27:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:32,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:27:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:27:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:32,251 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:32,264 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2024-11-10 15:27:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:27:32,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 15:27:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:32,266 INFO L225 Difference]: With dead ends: 142 [2024-11-10 15:27:32,266 INFO L226 Difference]: Without dead ends: 142 [2024-11-10 15:27:32,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:32,267 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 10 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:32,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 277 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:27:32,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-10 15:27:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2024-11-10 15:27:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2024-11-10 15:27:32,275 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 8 [2024-11-10 15:27:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:32,276 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2024-11-10 15:27:32,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2024-11-10 15:27:32,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:27:32,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:32,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:32,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:27:32,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:32,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1299457162, now seen corresponding path program 1 times [2024-11-10 15:27:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278541139] [2024-11-10 15:27:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278541139] [2024-11-10 15:27:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278541139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:32,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:32,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:27:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034736880] [2024-11-10 15:27:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:27:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:32,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:27:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:32,338 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:32,357 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2024-11-10 15:27:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:27:32,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:27:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:32,359 INFO L225 Difference]: With dead ends: 138 [2024-11-10 15:27:32,359 INFO L226 Difference]: Without dead ends: 138 [2024-11-10 15:27:32,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:32,361 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 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-10 15:27:32,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:27:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-10 15:27:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-10 15:27:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 83 states have (on average 1.7951807228915662) internal successors, (149), 137 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2024-11-10 15:27:32,368 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 10 [2024-11-10 15:27:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:32,369 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2024-11-10 15:27:32,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2024-11-10 15:27:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:27:32,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:32,370 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:32,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:27:32,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:32,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1179237111, now seen corresponding path program 1 times [2024-11-10 15:27:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:32,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651567226] [2024-11-10 15:27:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:32,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651567226] [2024-11-10 15:27:32,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651567226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:32,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350283786] [2024-11-10 15:27:32,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:32,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:32,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:32,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:32,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:27:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:32,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:27:32,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:32,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:32,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350283786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:32,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:32,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-10 15:27:32,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172232211] [2024-11-10 15:27:32,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:27:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:27:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:32,700 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:32,728 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2024-11-10 15:27:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:27:32,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-10 15:27:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:32,730 INFO L225 Difference]: With dead ends: 141 [2024-11-10 15:27:32,730 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 15:27:32,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:32,731 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 10 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:32,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 542 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:27:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 15:27:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-10 15:27:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.7674418604651163) internal successors, (152), 140 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2024-11-10 15:27:32,745 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 16 [2024-11-10 15:27:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:32,745 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2024-11-10 15:27:32,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2024-11-10 15:27:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:27:32,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:32,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:32,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:27:32,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:32,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:32,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:32,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1365874040, now seen corresponding path program 1 times [2024-11-10 15:27:32,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:32,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666113437] [2024-11-10 15:27:32,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:32,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666113437] [2024-11-10 15:27:33,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666113437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115961834] [2024-11-10 15:27:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:33,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:33,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:33,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:33,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:27:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:33,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 15:27:33,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:33,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:27:33,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:27:33,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:33,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:33,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:27:33,517 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-10 15:27:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:33,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:33,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115961834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:33,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:33,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-10 15:27:33,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712565446] [2024-11-10 15:27:33,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:33,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:27:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:27:33,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:27:33,900 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:34,305 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2024-11-10 15:27:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:27:34,305 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:27:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:34,307 INFO L225 Difference]: With dead ends: 139 [2024-11-10 15:27:34,307 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 15:27:34,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:27:34,309 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 15 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:34,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 520 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:27:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 15:27:34,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-10 15:27:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 86 states have (on average 1.744186046511628) internal successors, (150), 138 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2024-11-10 15:27:34,321 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 18 [2024-11-10 15:27:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:34,324 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2024-11-10 15:27:34,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2024-11-10 15:27:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:27:34,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:34,325 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:34,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:27:34,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 15:27:34,527 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:34,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1502199451, now seen corresponding path program 2 times [2024-11-10 15:27:34,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:34,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541338664] [2024-11-10 15:27:34,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:34,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:34,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:34,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541338664] [2024-11-10 15:27:34,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541338664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:34,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49113907] [2024-11-10 15:27:34,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:27:34,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:34,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:34,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:34,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:27:34,699 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 15:27:34,700 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:27:34,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:27:34,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:34,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:27:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:34,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:27:34,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49113907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:34,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:27:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-10 15:27:34,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339881311] [2024-11-10 15:27:34,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:34,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:27:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:34,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:27:34,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:34,722 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:34,807 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2024-11-10 15:27:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:27:34,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 15:27:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:34,808 INFO L225 Difference]: With dead ends: 136 [2024-11-10 15:27:34,808 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 15:27:34,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:34,809 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:34,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 202 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 15:27:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-10 15:27:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 86 states have (on average 1.7093023255813953) internal successors, (147), 135 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2024-11-10 15:27:34,814 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 24 [2024-11-10 15:27:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:34,815 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2024-11-10 15:27:34,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2024-11-10 15:27:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:27:34,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:34,816 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:34,833 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-10 15:27:35,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:35,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:35,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1502199452, now seen corresponding path program 1 times [2024-11-10 15:27:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:35,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145036333] [2024-11-10 15:27:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145036333] [2024-11-10 15:27:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145036333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512790825] [2024-11-10 15:27:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:35,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:35,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:35,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:35,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:27:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:35,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:27:35,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:35,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:35,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512790825] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:35,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:35,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-10 15:27:35,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990564849] [2024-11-10 15:27:35,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:35,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:27:35,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:35,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:27:35,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:27:35,270 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:35,303 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2024-11-10 15:27:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:27:35,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 15:27:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:35,305 INFO L225 Difference]: With dead ends: 136 [2024-11-10 15:27:35,305 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 15:27:35,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:35,307 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:35,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 382 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:27:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 15:27:35,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-10 15:27:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 86 states have (on average 1.697674418604651) internal successors, (146), 135 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2024-11-10 15:27:35,312 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 24 [2024-11-10 15:27:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:35,316 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2024-11-10 15:27:35,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2024-11-10 15:27:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:27:35,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:35,317 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:35,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 15:27:35,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:35,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:35,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:35,518 INFO L85 PathProgramCache]: Analyzing trace with hash 633014415, now seen corresponding path program 1 times [2024-11-10 15:27:35,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:35,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680118719] [2024-11-10 15:27:35,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680118719] [2024-11-10 15:27:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680118719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:35,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:35,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:27:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491977458] [2024-11-10 15:27:35,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:35,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:27:35,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:35,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:27:35,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:35,631 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:35,700 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2024-11-10 15:27:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:27:35,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-10 15:27:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:35,702 INFO L225 Difference]: With dead ends: 133 [2024-11-10 15:27:35,702 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 15:27:35,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:35,703 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:35,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 207 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 15:27:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-10 15:27:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 86 states have (on average 1.6627906976744187) internal successors, (143), 132 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2024-11-10 15:27:35,706 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 25 [2024-11-10 15:27:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:35,706 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2024-11-10 15:27:35,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2024-11-10 15:27:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:27:35,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:35,707 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:35,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:27:35,707 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:35,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:35,708 INFO L85 PathProgramCache]: Analyzing trace with hash -691845375, now seen corresponding path program 1 times [2024-11-10 15:27:35,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:35,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485291457] [2024-11-10 15:27:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:35,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:27:35,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485291457] [2024-11-10 15:27:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485291457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:35,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125957259] [2024-11-10 15:27:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:35,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:35,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:35,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:35,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:27:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:36,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 15:27:36,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:36,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:27:36,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:36,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:36,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:36,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:36,249 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:27:36,249 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-10 15:27:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:27:36,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:27:36,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125957259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:36,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:36,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2024-11-10 15:27:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350614867] [2024-11-10 15:27:36,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:36,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:27:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:36,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:27:36,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:27:36,438 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:36,623 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2024-11-10 15:27:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:27:36,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 15:27:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:36,625 INFO L225 Difference]: With dead ends: 141 [2024-11-10 15:27:36,625 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 15:27:36,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:27:36,625 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 260 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:36,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 231 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:27:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 15:27:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 126. [2024-11-10 15:27:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2024-11-10 15:27:36,629 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 30 [2024-11-10 15:27:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:36,630 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2024-11-10 15:27:36,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2024-11-10 15:27:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:27:36,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:36,634 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:36,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:27:36,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 15:27:36,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:36,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash -691845374, now seen corresponding path program 1 times [2024-11-10 15:27:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:36,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222301739] [2024-11-10 15:27:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:27:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222301739] [2024-11-10 15:27:37,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222301739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270801764] [2024-11-10 15:27:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:37,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:37,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:37,326 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:37,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:27:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:37,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 15:27:37,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:37,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:27:37,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:37,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:37,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:37,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:37,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:37,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:37,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:27:37,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270801764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:37,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:27:37,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-10 15:27:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287615729] [2024-11-10 15:27:37,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:37,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:27:37,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:37,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:27:37,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:27:37,699 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:37,810 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2024-11-10 15:27:37,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:27:37,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 15:27:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:37,812 INFO L225 Difference]: With dead ends: 120 [2024-11-10 15:27:37,812 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 15:27:37,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:27:37,813 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 125 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:37,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 141 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 15:27:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-10 15:27:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.5) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2024-11-10 15:27:37,818 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 30 [2024-11-10 15:27:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:37,818 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2024-11-10 15:27:37,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2024-11-10 15:27:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:27:37,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:37,820 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:37,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 15:27:38,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:38,021 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:38,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1509480230, now seen corresponding path program 1 times [2024-11-10 15:27:38,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:38,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579580145] [2024-11-10 15:27:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:27:38,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:38,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579580145] [2024-11-10 15:27:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579580145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:38,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:27:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654264645] [2024-11-10 15:27:38,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:38,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:27:38,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:38,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:27:38,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:27:38,387 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:38,709 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2024-11-10 15:27:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:27:38,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-10 15:27:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:38,711 INFO L225 Difference]: With dead ends: 149 [2024-11-10 15:27:38,711 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 15:27:38,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:27:38,712 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 104 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:38,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 453 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:27:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 15:27:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 128. [2024-11-10 15:27:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.568421052631579) internal successors, (149), 127 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2024-11-10 15:27:38,715 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 34 [2024-11-10 15:27:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:38,716 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2024-11-10 15:27:38,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2024-11-10 15:27:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:27:38,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:38,717 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:38,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:27:38,717 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:38,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1509480231, now seen corresponding path program 1 times [2024-11-10 15:27:38,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:38,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445336513] [2024-11-10 15:27:38,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:38,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:27:38,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:38,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445336513] [2024-11-10 15:27:38,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445336513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:38,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:38,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:27:38,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938536594] [2024-11-10 15:27:38,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:38,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:27:38,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:38,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:27:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:27:38,992 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:39,295 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2024-11-10 15:27:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:27:39,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-10 15:27:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:39,297 INFO L225 Difference]: With dead ends: 149 [2024-11-10 15:27:39,297 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 15:27:39,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:27:39,298 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 172 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:39,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 433 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:27:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 15:27:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 128. [2024-11-10 15:27:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 127 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 147 transitions. [2024-11-10 15:27:39,301 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 147 transitions. Word has length 34 [2024-11-10 15:27:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:39,302 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 147 transitions. [2024-11-10 15:27:39,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2024-11-10 15:27:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:27:39,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:39,302 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:39,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:27:39,303 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:39,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:39,303 INFO L85 PathProgramCache]: Analyzing trace with hash 450751148, now seen corresponding path program 1 times [2024-11-10 15:27:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:39,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490262921] [2024-11-10 15:27:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:39,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:39,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490262921] [2024-11-10 15:27:39,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490262921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:39,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:39,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:27:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367215184] [2024-11-10 15:27:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:39,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:27:39,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:39,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:27:39,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:39,358 INFO L87 Difference]: Start difference. First operand 128 states and 147 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:39,371 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2024-11-10 15:27:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:27:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-10 15:27:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:39,372 INFO L225 Difference]: With dead ends: 123 [2024-11-10 15:27:39,372 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 15:27:39,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:27:39,373 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:39,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:27:39,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 15:27:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-10 15:27:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 90 states have (on average 1.488888888888889) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2024-11-10 15:27:39,376 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 35 [2024-11-10 15:27:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:39,376 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2024-11-10 15:27:39,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2024-11-10 15:27:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:27:39,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:39,377 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:39,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:27:39,377 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:39,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:39,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1088385430, now seen corresponding path program 1 times [2024-11-10 15:27:39,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:39,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838959233] [2024-11-10 15:27:39,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:39,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:39,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838959233] [2024-11-10 15:27:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838959233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:39,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:39,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:27:39,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449307881] [2024-11-10 15:27:39,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:39,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:27:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:39,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:27:39,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:39,458 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:39,581 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2024-11-10 15:27:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:27:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-10 15:27:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:39,583 INFO L225 Difference]: With dead ends: 121 [2024-11-10 15:27:39,583 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 15:27:39,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:39,583 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 26 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:39,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 266 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 15:27:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-10 15:27:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 119 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2024-11-10 15:27:39,589 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 36 [2024-11-10 15:27:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:39,589 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2024-11-10 15:27:39,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2024-11-10 15:27:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:27:39,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:39,590 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:39,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:27:39,590 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:39,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1088385431, now seen corresponding path program 1 times [2024-11-10 15:27:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:39,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711350395] [2024-11-10 15:27:39,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:27:39,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711350395] [2024-11-10 15:27:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711350395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814068446] [2024-11-10 15:27:39,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:39,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:39,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:39,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:39,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:27:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:39,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:27:39,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:39,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:27:39,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814068446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:39,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:27:39,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-10 15:27:39,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050193211] [2024-11-10 15:27:39,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:39,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:27:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:27:39,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:39,980 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:40,003 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2024-11-10 15:27:40,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:27:40,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-10 15:27:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:40,004 INFO L225 Difference]: With dead ends: 123 [2024-11-10 15:27:40,004 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 15:27:40,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:27:40,005 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 88 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:40,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 234 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:27:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 15:27:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-10 15:27:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.449438202247191) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2024-11-10 15:27:40,008 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 36 [2024-11-10 15:27:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:40,008 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2024-11-10 15:27:40,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2024-11-10 15:27:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:27:40,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:40,009 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:40,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:27:40,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:40,211 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:40,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1974349060, now seen corresponding path program 1 times [2024-11-10 15:27:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657707841] [2024-11-10 15:27:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:27:40,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:40,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657707841] [2024-11-10 15:27:40,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657707841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:40,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938210773] [2024-11-10 15:27:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:40,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:40,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:40,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:40,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:27:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:40,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:27:40,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:40,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:27:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938210773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:40,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:27:40,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-10 15:27:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373646520] [2024-11-10 15:27:40,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:40,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:27:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:40,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:27:40,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:27:40,604 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:40,628 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2024-11-10 15:27:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:27:40,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-10 15:27:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:40,629 INFO L225 Difference]: With dead ends: 120 [2024-11-10 15:27:40,629 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 15:27:40,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:27:40,630 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 80 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:40,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 241 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:27:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 15:27:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2024-11-10 15:27:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 115 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2024-11-10 15:27:40,633 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 38 [2024-11-10 15:27:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:40,633 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2024-11-10 15:27:40,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2024-11-10 15:27:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:27:40,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:40,634 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:40,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:27:40,834 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,SelfDestructingSolverStorable16 [2024-11-10 15:27:40,835 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:40,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1075280694, now seen corresponding path program 1 times [2024-11-10 15:27:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:40,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193209377] [2024-11-10 15:27:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:40,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193209377] [2024-11-10 15:27:40,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193209377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:40,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:40,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:27:40,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328506766] [2024-11-10 15:27:40,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:40,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:27:40,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:40,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:27:40,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:27:40,915 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:41,011 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-10 15:27:41,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:27:41,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-10 15:27:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:41,012 INFO L225 Difference]: With dead ends: 115 [2024-11-10 15:27:41,013 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 15:27:41,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:27:41,013 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:41,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 226 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 15:27:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-10 15:27:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 114 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-10 15:27:41,016 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 39 [2024-11-10 15:27:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:41,016 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-10 15:27:41,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-10 15:27:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:27:41,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:41,017 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:41,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:27:41,017 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:41,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1075280693, now seen corresponding path program 1 times [2024-11-10 15:27:41,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:41,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172960905] [2024-11-10 15:27:41,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:27:41,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172960905] [2024-11-10 15:27:41,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172960905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136057228] [2024-11-10 15:27:41,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:41,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:41,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:41,261 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:41,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:27:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:41,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 15:27:41,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:41,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:27:41,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:27:41,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:27:41,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:27:41,862 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:27:41,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:27:41,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:27:41,945 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 15 treesize of output 7 [2024-11-10 15:27:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:42,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:42,281 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 19 [2024-11-10 15:27:42,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-10 15:27:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:27:42,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136057228] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:42,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:42,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 29 [2024-11-10 15:27:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868400873] [2024-11-10 15:27:42,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:42,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:27:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:42,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:27:42,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:27:42,505 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 30 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:43,265 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-10 15:27:43,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:27:43,266 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 30 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-10 15:27:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:43,267 INFO L225 Difference]: With dead ends: 115 [2024-11-10 15:27:43,267 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 15:27:43,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 15:27:43,268 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 196 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:43,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1294 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:27:43,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 15:27:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-10 15:27:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 113 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2024-11-10 15:27:43,271 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 39 [2024-11-10 15:27:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:43,271 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2024-11-10 15:27:43,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 30 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2024-11-10 15:27:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:27:43,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:43,272 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:43,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:27:43,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:43,476 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:43,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1026036920, now seen corresponding path program 1 times [2024-11-10 15:27:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904930280] [2024-11-10 15:27:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:27:43,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:43,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904930280] [2024-11-10 15:27:43,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904930280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:27:43,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:27:43,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:27:43,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285957224] [2024-11-10 15:27:43,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:27:43,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:27:43,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:43,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:27:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:43,634 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:43,735 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2024-11-10 15:27:43,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:27:43,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-10 15:27:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:43,736 INFO L225 Difference]: With dead ends: 112 [2024-11-10 15:27:43,736 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 15:27:43,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:27:43,738 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 18 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:43,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 272 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:27:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 15:27:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-10 15:27:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-11-10 15:27:43,743 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 40 [2024-11-10 15:27:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:43,744 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-10 15:27:43,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2024-11-10 15:27:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 15:27:43,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:43,744 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:43,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:27:43,744 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:43,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash -616330204, now seen corresponding path program 1 times [2024-11-10 15:27:43,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:43,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123324869] [2024-11-10 15:27:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:44,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123324869] [2024-11-10 15:27:44,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123324869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:44,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048307550] [2024-11-10 15:27:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:44,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:44,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:44,584 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:44,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:27:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:44,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-10 15:27:44,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:44,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:27:45,028 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:27:45,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:27:45,096 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-10 15:27:45,156 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 23 treesize of output 11 [2024-11-10 15:27:45,191 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:27:45,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:27:45,411 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-10 15:27:45,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-10 15:27:45,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-10 15:27:45,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-10 15:27:45,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-10 15:27:45,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2024-11-10 15:27:45,751 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 33 treesize of output 17 [2024-11-10 15:27:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:45,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:46,244 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 34 treesize of output 26 [2024-11-10 15:27:46,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-10 15:27:50,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:27:50,516 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 2 case distinctions, treesize of input 35 treesize of output 41 [2024-11-10 15:27:50,521 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 180 treesize of output 162 [2024-11-10 15:27:50,531 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 35 treesize of output 31 [2024-11-10 15:27:50,536 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 38 treesize of output 30 [2024-11-10 15:27:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:51,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048307550] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:51,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:51,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 50 [2024-11-10 15:27:51,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51458016] [2024-11-10 15:27:51,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:51,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-10 15:27:51,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:51,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 15:27:51,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2326, Unknown=8, NotChecked=0, Total=2550 [2024-11-10 15:27:51,049 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 51 states, 50 states have (on average 2.44) internal successors, (122), 51 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:52,685 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-11-10 15:27:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:27:52,686 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.44) internal successors, (122), 51 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-10 15:27:52,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:52,686 INFO L225 Difference]: With dead ends: 118 [2024-11-10 15:27:52,686 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 15:27:52,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=411, Invalid=3741, Unknown=8, NotChecked=0, Total=4160 [2024-11-10 15:27:52,688 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 166 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:52,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1413 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 15:27:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 15:27:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2024-11-10 15:27:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 109 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2024-11-10 15:27:52,693 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 43 [2024-11-10 15:27:52,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:52,694 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2024-11-10 15:27:52,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.44) internal successors, (122), 51 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2024-11-10 15:27:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 15:27:52,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:52,695 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:52,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 15:27:52,895 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,SelfDestructingSolverStorable20 [2024-11-10 15:27:52,895 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:52,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash -616330203, now seen corresponding path program 1 times [2024-11-10 15:27:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:52,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078616129] [2024-11-10 15:27:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:54,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:54,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078616129] [2024-11-10 15:27:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078616129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:54,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175851758] [2024-11-10 15:27:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:54,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:54,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:54,175 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:54,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:27:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:54,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-10 15:27:54,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:54,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:27:54,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:27:54,705 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:27:54,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:27:54,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:54,785 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-10 15:27:54,791 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-10 15:27:54,839 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 23 treesize of output 11 [2024-11-10 15:27:54,847 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 19 treesize of output 18 [2024-11-10 15:27:54,939 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:27:54,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-10 15:27:54,944 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 16 [2024-11-10 15:27:55,139 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-10 15:27:55,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2024-11-10 15:27:55,164 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-10 15:27:55,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-10 15:27:55,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-10 15:27:55,253 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 31 treesize of output 20 [2024-11-10 15:27:55,269 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 20 [2024-11-10 15:27:55,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-10 15:27:55,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-10 15:27:55,314 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 31 treesize of output 20 [2024-11-10 15:27:55,439 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 59 treesize of output 35 [2024-11-10 15:27:55,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 25 treesize of output 13 [2024-11-10 15:27:55,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:27:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:55,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:55,820 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (and (forall ((v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1878) .cse0) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1877) .cse0) .cse1)))) (forall ((v_ArrVal_1878 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1878) .cse0) .cse1) 8))))) is different from false [2024-11-10 15:27:55,851 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 76 treesize of output 60 [2024-11-10 15:27:55,855 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 48 [2024-11-10 15:27:56,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:27:56,361 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 2 case distinctions, treesize of input 64 treesize of output 70 [2024-11-10 15:27:56,366 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 412 treesize of output 394 [2024-11-10 15:27:56,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:27:56,382 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 2 case distinctions, treesize of input 190 treesize of output 150 [2024-11-10 15:27:56,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:27:56,392 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 890 treesize of output 830 [2024-11-10 15:27:56,418 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 43 treesize of output 39 [2024-11-10 15:27:56,423 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 39 treesize of output 35 [2024-11-10 15:27:56,427 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 50 treesize of output 42 [2024-11-10 15:27:56,432 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 42 treesize of output 34 [2024-11-10 15:27:56,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:27:56,465 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 2 case distinctions, treesize of input 32 treesize of output 38 [2024-11-10 15:27:56,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:27:56,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:27:56,472 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 50 treesize of output 32 [2024-11-10 15:27:56,480 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 5 [2024-11-10 15:27:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:27:57,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175851758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:57,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:57,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 15] total 45 [2024-11-10 15:27:57,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531517873] [2024-11-10 15:27:57,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:57,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-10 15:27:57,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:57,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-10 15:27:57,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1825, Unknown=6, NotChecked=86, Total=2070 [2024-11-10 15:27:57,046 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 46 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:27:58,865 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2024-11-10 15:27:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 15:27:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-10 15:27:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:27:58,866 INFO L225 Difference]: With dead ends: 116 [2024-11-10 15:27:58,866 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 15:27:58,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=405, Invalid=3499, Unknown=6, NotChecked=122, Total=4032 [2024-11-10 15:27:58,867 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 131 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:27:58,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1485 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1814 Invalid, 0 Unknown, 105 Unchecked, 1.2s Time] [2024-11-10 15:27:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 15:27:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2024-11-10 15:27:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 108 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-11-10 15:27:58,870 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 43 [2024-11-10 15:27:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:27:58,870 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-11-10 15:27:58,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:27:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-11-10 15:27:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:27:58,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:27:58,871 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:27:58,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:27:59,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 15:27:59,072 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:27:59,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:27:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash 857932217, now seen corresponding path program 1 times [2024-11-10 15:27:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:27:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777532896] [2024-11-10 15:27:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:27:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:27:59,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:27:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777532896] [2024-11-10 15:27:59,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777532896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:27:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966510942] [2024-11-10 15:27:59,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:27:59,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:27:59,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:27:59,254 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:27:59,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:27:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:27:59,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 15:27:59,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:27:59,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:59,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:59,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:59,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:27:59,617 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:27:59,617 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-10 15:27:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:59,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:27:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:27:59,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966510942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:27:59,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:27:59,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2024-11-10 15:27:59,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679194723] [2024-11-10 15:27:59,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:27:59,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 15:27:59,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:27:59,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 15:27:59,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:27:59,826 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:00,227 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2024-11-10 15:28:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:28:00,228 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-10 15:28:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:00,229 INFO L225 Difference]: With dead ends: 98 [2024-11-10 15:28:00,229 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 15:28:00,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2024-11-10 15:28:00,230 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 156 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:00,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 589 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:28:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 15:28:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 15:28:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-11-10 15:28:00,233 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 45 [2024-11-10 15:28:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:00,234 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-11-10 15:28:00,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-10 15:28:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:28:00,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:00,234 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:00,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-10 15:28:00,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 15:28:00,439 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:28:00,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash 280432546, now seen corresponding path program 1 times [2024-11-10 15:28:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:00,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041275389] [2024-11-10 15:28:00,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:00,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041275389] [2024-11-10 15:28:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041275389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:00,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398790606] [2024-11-10 15:28:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:00,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:00,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:00,685 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-10 15:28:00,686 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-10 15:28:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:00,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 15:28:00,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:01,021 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-10 15:28:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:01,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:01,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398790606] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:01,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:28:01,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 15 [2024-11-10 15:28:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987949694] [2024-11-10 15:28:01,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:01,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:28:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:01,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:28:01,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:28:01,174 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:01,294 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-11-10 15:28:01,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:28:01,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-10 15:28:01,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:01,295 INFO L225 Difference]: With dead ends: 107 [2024-11-10 15:28:01,295 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 15:28:01,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:28:01,296 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 64 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:01,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 489 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 15:28:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2024-11-10 15:28:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 99 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2024-11-10 15:28:01,298 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 48 [2024-11-10 15:28:01,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:01,298 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2024-11-10 15:28:01,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2024-11-10 15:28:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:28:01,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:01,299 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:01,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:01,500 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,SelfDestructingSolverStorable23 [2024-11-10 15:28:01,500 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:28:01,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash 280432589, now seen corresponding path program 1 times [2024-11-10 15:28:01,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:01,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98037031] [2024-11-10 15:28:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98037031] [2024-11-10 15:28:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98037031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915508507] [2024-11-10 15:28:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:01,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:01,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:01,666 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-10 15:28:01,668 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-10 15:28:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:01,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:28:01,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:01,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:01,955 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-10 15:28:01,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:28:01,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:28:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:28:02,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:28:02,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915508507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:02,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:28:02,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-10 15:28:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885264800] [2024-11-10 15:28:02,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:02,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:28:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:28:02,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:28:02,001 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:02,179 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2024-11-10 15:28:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:28:02,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-10 15:28:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:02,180 INFO L225 Difference]: With dead ends: 102 [2024-11-10 15:28:02,180 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 15:28:02,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:28:02,180 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 57 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:02,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 312 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 15:28:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-10 15:28:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-11-10 15:28:02,182 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 48 [2024-11-10 15:28:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:02,183 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-11-10 15:28:02,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-11-10 15:28:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:28:02,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:02,184 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:02,199 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-10 15:28:02,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:02,387 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:28:02,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 280432590, now seen corresponding path program 1 times [2024-11-10 15:28:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:02,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093713761] [2024-11-10 15:28:02,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:02,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:02,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093713761] [2024-11-10 15:28:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093713761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:02,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198269646] [2024-11-10 15:28:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:02,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:02,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:02,786 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-10 15:28:02,788 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-10 15:28:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:03,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:28:03,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:03,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 8 treesize of output 1 [2024-11-10 15:28:03,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:03,139 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:28:03,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:28:03,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:28:03,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:28:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:28:03,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:28:03,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198269646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:03,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:28:03,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2024-11-10 15:28:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555795185] [2024-11-10 15:28:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:03,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:28:03,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:03,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:28:03,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:28:03,253 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:03,472 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2024-11-10 15:28:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:28:03,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-10 15:28:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:03,473 INFO L225 Difference]: With dead ends: 100 [2024-11-10 15:28:03,473 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 15:28:03,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:28:03,474 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:03,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 308 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:28:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 15:28:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-10 15:28:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 99 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2024-11-10 15:28:03,476 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 48 [2024-11-10 15:28:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:03,476 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2024-11-10 15:28:03,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2024-11-10 15:28:03,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:28:03,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:03,477 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:03,490 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-10 15:28:03,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 15:28:03,678 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:28:03,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:03,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1833612078, now seen corresponding path program 1 times [2024-11-10 15:28:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:03,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298120290] [2024-11-10 15:28:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:04,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:04,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298120290] [2024-11-10 15:28:04,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298120290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:04,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915315626] [2024-11-10 15:28:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:04,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:04,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:04,805 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-10 15:28:04,807 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-10 15:28:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:05,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-10 15:28:05,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:05,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:05,218 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:28:05,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:28:05,271 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-10 15:28:05,326 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 23 treesize of output 11 [2024-11-10 15:28:05,348 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 23 treesize of output 11 [2024-11-10 15:28:05,377 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-10 15:28:05,609 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-10 15:28:05,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-10 15:28:05,688 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 20 treesize of output 15 [2024-11-10 15:28:05,703 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 20 treesize of output 15 [2024-11-10 15:28:05,726 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 20 treesize of output 15 [2024-11-10 15:28:06,071 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2024-11-10 15:28:06,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 21 [2024-11-10 15:28:06,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 30 treesize of output 25 [2024-11-10 15:28:06,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-10 15:28:06,253 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 29 treesize of output 21 [2024-11-10 15:28:06,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-10 15:28:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:06,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:07,226 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 48 [2024-11-10 15:28:07,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 58 treesize of output 38 [2024-11-10 15:28:07,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_arrayElimCell_97 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| v_arrayElimCell_97) (not (= (let ((.cse0 (+ 4 v_arrayElimCell_97))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2732) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0 (select v_ArrVal_2733 .cse0))) v_ArrVal_2733)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2733) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2736) |c_ULTIMATE.start_dll_create_#res#1.base|) v_arrayElimCell_97)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_arrayElimCell_97 0))) is different from false [2024-11-10 15:28:07,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_arrayElimCell_97 Int)) (or (not (= (let ((.cse0 (+ 4 v_arrayElimCell_97))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2732) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0 (select v_ArrVal_2733 .cse0))) v_ArrVal_2733)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2733) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2736) |c_ULTIMATE.start_dll_create_~head~0#1.base|) v_arrayElimCell_97) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_arrayElimCell_97 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_97))) is different from false [2024-11-10 15:28:07,318 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_arrayElimCell_97 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_arrayElimCell_97 0) (not (= (let ((.cse0 (+ 4 v_arrayElimCell_97))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2732) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_2733 .cse0))) v_ArrVal_2733)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_arrayElimCell_97) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2733) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2736) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_arrayElimCell_97)))) is different from false [2024-11-10 15:28:07,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2729 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2729))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2733) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2736) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_arrayElimCell_97)) (not (= v_ArrVal_2733 (let ((.cse1 (+ 4 v_arrayElimCell_97))) (store (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2732) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_2733 .cse1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_arrayElimCell_97 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_arrayElimCell_97)))) is different from false [2024-11-10 15:28:07,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2729 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_2728 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2729) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2733) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2736) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_arrayElimCell_97)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (not (= v_ArrVal_2733 (let ((.cse0 (+ 4 v_arrayElimCell_97))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2728) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2729) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2732) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_2733 .cse0))))) (not (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_2728 .cse1))) v_ArrVal_2728)) (< v_arrayElimCell_97 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_arrayElimCell_97))) is different from false [2024-11-10 15:28:07,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2729 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_2728 (Array Int Int))) (or (not (= v_ArrVal_2728 (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_2728 .cse0))) .cse1 (select v_ArrVal_2728 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2729) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2733) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2736) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_arrayElimCell_97)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (not (= v_ArrVal_2733 (let ((.cse2 (+ 4 v_arrayElimCell_97))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2728) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2729) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2732) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 (select v_ArrVal_2733 .cse2))))) (< v_arrayElimCell_97 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_arrayElimCell_97))) is different from false [2024-11-10 15:28:07,434 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 221 treesize of output 219 [2024-11-10 15:28:07,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:07,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 86 [2024-11-10 15:28:07,463 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:07,497 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-10 15:28:07,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 111 [2024-11-10 15:28:07,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:07,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 59 [2024-11-10 15:28:07,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-10 15:28:07,541 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 12 treesize of output 8 [2024-11-10 15:28:07,555 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 12 treesize of output 8 [2024-11-10 15:28:07,569 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 12 treesize of output 8 [2024-11-10 15:28:07,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-11-10 15:28:07,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:07,602 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 28 treesize of output 32 [2024-11-10 15:28:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-10 15:28:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915315626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:07,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:07,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 24] total 62 [2024-11-10 15:28:07,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127369866] [2024-11-10 15:28:07,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:07,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-10 15:28:07,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:07,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-10 15:28:07,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2833, Unknown=43, NotChecked=678, Total=3782 [2024-11-10 15:28:07,945 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 62 states, 62 states have (on average 2.435483870967742) internal successors, (151), 62 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:10,078 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2024-11-10 15:28:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:28:10,079 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.435483870967742) internal successors, (151), 62 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-10 15:28:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:10,080 INFO L225 Difference]: With dead ends: 146 [2024-11-10 15:28:10,080 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 15:28:10,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=467, Invalid=4916, Unknown=43, NotChecked=894, Total=6320 [2024-11-10 15:28:10,082 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 125 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 694 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:10,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1955 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1697 Invalid, 0 Unknown, 694 Unchecked, 1.0s Time] [2024-11-10 15:28:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 15:28:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 109. [2024-11-10 15:28:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 108 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2024-11-10 15:28:10,085 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 54 [2024-11-10 15:28:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:10,085 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2024-11-10 15:28:10,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.435483870967742) internal successors, (151), 62 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2024-11-10 15:28:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:28:10,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:10,086 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:10,104 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-10 15:28:10,289 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-10 15:28:10,290 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:28:10,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1833487995, now seen corresponding path program 1 times [2024-11-10 15:28:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:10,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716538822] [2024-11-10 15:28:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:10,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:11,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:11,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716538822] [2024-11-10 15:28:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716538822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:11,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854434975] [2024-11-10 15:28:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:11,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:11,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:11,387 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-10 15:28:11,388 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-10 15:28:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:11,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-10 15:28:11,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:11,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:11,749 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:28:11,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:28:11,806 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-10 15:28:11,851 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 23 treesize of output 11 [2024-11-10 15:28:11,880 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:11,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:28:12,036 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-11-10 15:28:12,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2024-11-10 15:28:12,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-10 15:28:12,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-10 15:28:12,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-10 15:28:12,477 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-10 15:28:12,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2024-11-10 15:28:12,619 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-10 15:28:12,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 74 [2024-11-10 15:28:12,649 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-10 15:28:12,730 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 81 treesize of output 58 [2024-11-10 15:28:12,939 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 128 treesize of output 80 [2024-11-10 15:28:12,943 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 15 treesize of output 7 [2024-11-10 15:28:13,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:13,250 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 81 treesize of output 59 [2024-11-10 15:28:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:13,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:18,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-10 15:28:18,985 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 15 treesize of output 7 [2024-11-10 15:28:23,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:23,532 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2024-11-10 15:28:23,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:23,543 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 708 treesize of output 702 [2024-11-10 15:28:23,553 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 354 treesize of output 338 [2024-11-10 15:28:23,569 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 326 treesize of output 314 [2024-11-10 15:28:23,584 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 304 treesize of output 288 [2024-11-10 15:28:23,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:23,700 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 44 treesize of output 44 [2024-11-10 15:28:23,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:23,757 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 268 treesize of output 260 [2024-11-10 15:28:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854434975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:24,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 57 [2024-11-10 15:28:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668436139] [2024-11-10 15:28:24,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:24,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-10 15:28:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-10 15:28:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3059, Unknown=56, NotChecked=0, Total=3306 [2024-11-10 15:28:24,991 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 58 states, 57 states have (on average 2.6140350877192984) internal successors, (149), 58 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:28,056 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2024-11-10 15:28:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 15:28:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.6140350877192984) internal successors, (149), 58 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-10 15:28:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:28,056 INFO L225 Difference]: With dead ends: 128 [2024-11-10 15:28:28,057 INFO L226 Difference]: Without dead ends: 128 [2024-11-10 15:28:28,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=458, Invalid=5806, Unknown=56, NotChecked=0, Total=6320 [2024-11-10 15:28:28,058 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 230 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:28,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1627 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 15:28:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-10 15:28:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 114. [2024-11-10 15:28:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 113 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2024-11-10 15:28:28,061 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 54 [2024-11-10 15:28:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:28,061 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2024-11-10 15:28:28,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.6140350877192984) internal successors, (149), 58 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2024-11-10 15:28:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:28:28,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:28,062 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:28,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:28,266 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-10 15:28:28,267 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 58 more)] === [2024-11-10 15:28:28,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1833487994, now seen corresponding path program 1 times [2024-11-10 15:28:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:28,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375170901] [2024-11-10 15:28:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:29,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:29,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375170901] [2024-11-10 15:28:29,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375170901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:29,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278104189] [2024-11-10 15:28:29,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:29,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:29,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:29,616 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-10 15:28:29,618 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-10 15:28:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:29,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-10 15:28:29,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:29,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:29,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:30,014 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:28:30,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-10 15:28:30,042 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:28:30,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:28:30,102 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-10 15:28:30,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:28:30,164 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 19 treesize of output 18 [2024-11-10 15:28:30,169 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 23 treesize of output 11 [2024-11-10 15:28:30,240 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:30,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2024-11-10 15:28:30,247 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 31 treesize of output 16 [2024-11-10 15:28:30,418 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-10 15:28:30,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-10 15:28:30,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-10 15:28:30,499 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 20 [2024-11-10 15:28:30,509 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 62 treesize of output 39 [2024-11-10 15:28:30,522 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 20 [2024-11-10 15:28:30,527 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 62 treesize of output 39 [2024-11-10 15:28:30,546 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 20 [2024-11-10 15:28:30,553 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 62 treesize of output 39 [2024-11-10 15:28:31,056 INFO L349 Elim1Store]: treesize reduction 30, result has 57.1 percent of original size [2024-11-10 15:28:31,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 64 [2024-11-10 15:28:31,092 INFO L349 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2024-11-10 15:28:31,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2024-11-10 15:28:31,238 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 130 treesize of output 107 [2024-11-10 15:28:31,242 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 130 treesize of output 107 [2024-11-10 15:28:31,278 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 130 treesize of output 107 [2024-11-10 15:28:31,281 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 130 treesize of output 107 [2024-11-10 15:28:31,417 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 71 treesize of output 43 [2024-11-10 15:28:31,543 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 33 treesize of output 17 [2024-11-10 15:28:31,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:28:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:31,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:44,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3121 (Array Int Int)) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3115 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~new_node~0#1.offset_36| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int)) (let ((.cse0 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3114) |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 |v_ULTIMATE.start_dll_insert_~new_node~0#1.offset_36|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3121) .cse1) .cse2) 1)) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3115) |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0) 0)) (< |c_ULTIMATE.start_node_create_~temp~0#1.offset| |v_ULTIMATE.start_dll_insert_~new_node~0#1.offset_36|)))) (forall ((v_ArrVal_3121 (Array Int Int)) (v_ArrVal_3122 (Array Int Int)) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3116 Int) (v_ArrVal_3115 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~new_node~0#1.offset_36| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3115) |ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse3 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (or (< (+ 3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3114) |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse3 |v_ULTIMATE.start_dll_insert_~new_node~0#1.offset_36|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3121) .cse1) .cse2)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse4 .cse3 v_ArrVal_3116)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3122) .cse1) .cse2))) (not (= (select .cse4 .cse3) 0)) (< |c_ULTIMATE.start_node_create_~temp~0#1.offset| |v_ULTIMATE.start_dll_insert_~new_node~0#1.offset_36|)))))) is different from false [2024-11-10 15:28:45,026 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 149 treesize of output 133 [2024-11-10 15:28:45,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 137 treesize of output 121