./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:56:14,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:56:14,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:56:14,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:56:14,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:56:14,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:56:14,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:56:14,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:56:14,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:56:14,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:56:14,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:56:14,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:56:14,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:56:14,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:56:14,930 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:56:14,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:56:14,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:56:14,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:56:14,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:56:14,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:56:14,932 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:56:14,936 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:56:14,936 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:56:14,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:56:14,937 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:56:14,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:56:14,937 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:56:14,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:56:14,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:56:14,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:56:14,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:56:14,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:56:14,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:56:14,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:56:14,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:56:14,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:56:14,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:56:14,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:56:14,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:56:14,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:56:14,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:56:14,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:56:14,947 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-17 02:56:15,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:56:15,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:56:15,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:56:15,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:56:15,229 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:56:15,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2024-11-17 02:56:16,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:56:16,931 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:56:16,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2024-11-17 02:56:16,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49be64ed6/09a457f6f93b469aa93844123cd97c0d/FLAG99a23c2df [2024-11-17 02:56:17,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49be64ed6/09a457f6f93b469aa93844123cd97c0d [2024-11-17 02:56:17,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:56:17,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:56:17,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:56:17,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:56:17,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:56:17,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:17,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b06a4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17, skipping insertion in model container [2024-11-17 02:56:17,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:17,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:56:17,666 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:17,714 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:17,720 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:17,726 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:17,735 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:17,759 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:17,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:56:17,779 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:56:17,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:56:17,928 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:56:17,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17 WrapperNode [2024-11-17 02:56:17,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:56:17,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:56:17,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:56:17,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:56:17,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:17,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,024 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-17 02:56:18,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:56:18,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:56:18,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:56:18,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:56:18,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,117 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-17 02:56:18,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:56:18,183 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:56:18,184 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:56:18,184 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:56:18,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (1/1) ... [2024-11-17 02:56:18,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:56:18,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:56:18,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 02:56:18,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 02:56:18,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 02:56:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 02:56:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 02:56:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 02:56:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:56:18,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:56:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:56:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:56:18,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:56:18,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:56:18,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:56:18,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:56:18,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:56:18,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:56:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:56:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 02:56:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 02:56:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:56:18,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:56:18,479 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:56:18,481 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:56:19,935 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2024-11-17 02:56:19,936 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:56:20,010 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:56:20,010 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 02:56:20,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:56:20 BoogieIcfgContainer [2024-11-17 02:56:20,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:56:20,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:56:20,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:56:20,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:56:20,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:56:17" (1/3) ... [2024-11-17 02:56:20,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196d4fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:56:20, skipping insertion in model container [2024-11-17 02:56:20,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:17" (2/3) ... [2024-11-17 02:56:20,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196d4fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:56:20, skipping insertion in model container [2024-11-17 02:56:20,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:56:20" (3/3) ... [2024-11-17 02:56:20,022 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test1-1.i [2024-11-17 02:56:20,037 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:56:20,038 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-17 02:56:20,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:56:20,147 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;@430fb6f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:56:20,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-17 02:56:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 751 states, 429 states have (on average 2.027972027972028) internal successors, (870), 746 states have internal predecessors, (870), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 02:56:20,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:20,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 02:56:20,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:20,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1771376733, now seen corresponding path program 1 times [2024-11-17 02:56:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:20,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233285171] [2024-11-17 02:56:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:20,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:20,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:20,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233285171] [2024-11-17 02:56:20,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233285171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:20,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:20,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:56:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510564374] [2024-11-17 02:56:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:20,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 02:56:20,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:20,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 02:56:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 02:56:20,417 INFO L87 Difference]: Start difference. First operand has 751 states, 429 states have (on average 2.027972027972028) internal successors, (870), 746 states have internal predecessors, (870), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 02:56:20,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:20,528 INFO L93 Difference]: Finished difference Result 740 states and 828 transitions. [2024-11-17 02:56:20,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 02:56:20,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 02:56:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:20,545 INFO L225 Difference]: With dead ends: 740 [2024-11-17 02:56:20,546 INFO L226 Difference]: Without dead ends: 737 [2024-11-17 02:56:20,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 02:56:20,551 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:20,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 806 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:56:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-17 02:56:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2024-11-17 02:56:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 421 states have (on average 1.9453681710213777) internal successors, (819), 732 states have internal predecessors, (819), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 825 transitions. [2024-11-17 02:56:20,629 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 825 transitions. Word has length 6 [2024-11-17 02:56:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:20,629 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 825 transitions. [2024-11-17 02:56:20,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 02:56:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 825 transitions. [2024-11-17 02:56:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 02:56:20,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:20,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 02:56:20,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 02:56:20,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:20,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:20,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1771376764, now seen corresponding path program 1 times [2024-11-17 02:56:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:20,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514835571] [2024-11-17 02:56:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:20,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:20,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514835571] [2024-11-17 02:56:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514835571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:20,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:56:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284477903] [2024-11-17 02:56:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:20,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:20,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:20,740 INFO L87 Difference]: Start difference. First operand 737 states and 825 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-17 02:56:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:21,333 INFO L93 Difference]: Finished difference Result 691 states and 780 transitions. [2024-11-17 02:56:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:21,334 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-17 02:56:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:21,339 INFO L225 Difference]: With dead ends: 691 [2024-11-17 02:56:21,339 INFO L226 Difference]: Without dead ends: 691 [2024-11-17 02:56:21,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:21,342 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 688 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:21,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 459 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:56:21,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-17 02:56:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 688. [2024-11-17 02:56:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 421 states have (on average 1.828978622327791) internal successors, (770), 683 states have internal predecessors, (770), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 776 transitions. [2024-11-17 02:56:21,377 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 776 transitions. Word has length 6 [2024-11-17 02:56:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:21,378 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 776 transitions. [2024-11-17 02:56:21,378 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-17 02:56:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 776 transitions. [2024-11-17 02:56:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 02:56:21,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:21,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 02:56:21,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 02:56:21,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:21,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:21,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1771376765, now seen corresponding path program 1 times [2024-11-17 02:56:21,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235313870] [2024-11-17 02:56:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:21,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235313870] [2024-11-17 02:56:21,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235313870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:21,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:21,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:56:21,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733189549] [2024-11-17 02:56:21,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:21,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:21,503 INFO L87 Difference]: Start difference. First operand 688 states and 776 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-17 02:56:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:21,977 INFO L93 Difference]: Finished difference Result 768 states and 862 transitions. [2024-11-17 02:56:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:21,978 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-17 02:56:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:21,981 INFO L225 Difference]: With dead ends: 768 [2024-11-17 02:56:21,981 INFO L226 Difference]: Without dead ends: 768 [2024-11-17 02:56:21,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:21,982 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 422 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:21,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 824 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 02:56:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-17 02:56:21,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 719. [2024-11-17 02:56:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 463 states have (on average 1.8142548596112311) internal successors, (840), 714 states have internal predecessors, (840), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 846 transitions. [2024-11-17 02:56:22,002 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 846 transitions. Word has length 6 [2024-11-17 02:56:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:22,002 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 846 transitions. [2024-11-17 02:56:22,003 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-17 02:56:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 846 transitions. [2024-11-17 02:56:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 02:56:22,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:22,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:22,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 02:56:22,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:22,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1457821496, now seen corresponding path program 1 times [2024-11-17 02:56:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:22,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073824292] [2024-11-17 02:56:22,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:22,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073824292] [2024-11-17 02:56:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073824292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:22,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:22,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:22,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577752851] [2024-11-17 02:56:22,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:22,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:22,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:22,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:22,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:22,063 INFO L87 Difference]: Start difference. First operand 719 states and 846 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-17 02:56:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:22,150 INFO L93 Difference]: Finished difference Result 1412 states and 1665 transitions. [2024-11-17 02:56:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:22,151 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-17 02:56:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:22,156 INFO L225 Difference]: With dead ends: 1412 [2024-11-17 02:56:22,156 INFO L226 Difference]: Without dead ends: 1412 [2024-11-17 02:56:22,157 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-17 02:56:22,158 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 730 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:22,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1707 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:56:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-11-17 02:56:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 721. [2024-11-17 02:56:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 465 states have (on average 1.810752688172043) internal successors, (842), 716 states have internal predecessors, (842), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 848 transitions. [2024-11-17 02:56:22,195 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 848 transitions. Word has length 8 [2024-11-17 02:56:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:22,195 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 848 transitions. [2024-11-17 02:56:22,195 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-17 02:56:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 848 transitions. [2024-11-17 02:56:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 02:56:22,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:22,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:22,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 02:56:22,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1558433268, now seen corresponding path program 1 times [2024-11-17 02:56:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897919518] [2024-11-17 02:56:22,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:22,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:22,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897919518] [2024-11-17 02:56:22,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897919518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:22,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:22,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:22,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101145360] [2024-11-17 02:56:22,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:22,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:22,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:22,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:22,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:22,299 INFO L87 Difference]: Start difference. First operand 721 states and 848 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-17 02:56:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:22,885 INFO L93 Difference]: Finished difference Result 747 states and 901 transitions. [2024-11-17 02:56:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:56:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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 17 [2024-11-17 02:56:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:22,889 INFO L225 Difference]: With dead ends: 747 [2024-11-17 02:56:22,889 INFO L226 Difference]: Without dead ends: 747 [2024-11-17 02:56:22,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-17 02:56:22,892 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 952 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:22,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 721 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:56:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-11-17 02:56:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 698. [2024-11-17 02:56:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 465 states have (on average 1.761290322580645) internal successors, (819), 693 states have internal predecessors, (819), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 825 transitions. [2024-11-17 02:56:22,913 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 825 transitions. Word has length 17 [2024-11-17 02:56:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:22,914 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 825 transitions. [2024-11-17 02:56:22,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-17 02:56:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 825 transitions. [2024-11-17 02:56:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 02:56:22,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:22,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:22,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 02:56:22,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1558433269, now seen corresponding path program 1 times [2024-11-17 02:56:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:22,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389505577] [2024-11-17 02:56:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:22,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:23,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:23,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389505577] [2024-11-17 02:56:23,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389505577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:23,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:23,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:23,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587433874] [2024-11-17 02:56:23,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:23,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:23,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:23,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:23,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:23,035 INFO L87 Difference]: Start difference. First operand 698 states and 825 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) 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-17 02:56:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:23,078 INFO L93 Difference]: Finished difference Result 623 states and 722 transitions. [2024-11-17 02:56:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) 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 17 [2024-11-17 02:56:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:23,081 INFO L225 Difference]: With dead ends: 623 [2024-11-17 02:56:23,081 INFO L226 Difference]: Without dead ends: 623 [2024-11-17 02:56:23,082 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-17 02:56:23,082 INFO L432 NwaCegarLoop]: 614 mSDtfsCounter, 61 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:23,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1174 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:56:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-17 02:56:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2024-11-17 02:56:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 402 states have (on average 1.7810945273631842) internal successors, (716), 618 states have internal predecessors, (716), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 722 transitions. [2024-11-17 02:56:23,093 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 722 transitions. Word has length 17 [2024-11-17 02:56:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:23,093 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 722 transitions. [2024-11-17 02:56:23,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) 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-17 02:56:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 722 transitions. [2024-11-17 02:56:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 02:56:23,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:23,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:23,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 02:56:23,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr289REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:23,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1289340968, now seen corresponding path program 1 times [2024-11-17 02:56:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:23,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166772174] [2024-11-17 02:56:23,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:23,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:23,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166772174] [2024-11-17 02:56:23,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166772174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:23,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:23,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:56:23,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276547876] [2024-11-17 02:56:23,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:23,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:23,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:23,166 INFO L87 Difference]: Start difference. First operand 623 states and 722 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 02:56:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:23,248 INFO L93 Difference]: Finished difference Result 605 states and 697 transitions. [2024-11-17 02:56:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:56:23,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-17 02:56:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:23,252 INFO L225 Difference]: With dead ends: 605 [2024-11-17 02:56:23,252 INFO L226 Difference]: Without dead ends: 605 [2024-11-17 02:56:23,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-17 02:56:23,253 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 41 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:23,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1708 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:56:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-17 02:56:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 602. [2024-11-17 02:56:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 388 states have (on average 1.7731958762886597) internal successors, (688), 597 states have internal predecessors, (688), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 694 transitions. [2024-11-17 02:56:23,269 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 694 transitions. Word has length 19 [2024-11-17 02:56:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:23,271 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 694 transitions. [2024-11-17 02:56:23,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 02:56:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 694 transitions. [2024-11-17 02:56:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 02:56:23,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:23,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:23,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 02:56:23,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr275REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:23,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1141935218, now seen corresponding path program 1 times [2024-11-17 02:56:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:23,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470496751] [2024-11-17 02:56:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:23,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:23,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:23,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470496751] [2024-11-17 02:56:23,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470496751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:23,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:23,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529564516] [2024-11-17 02:56:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:23,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:23,479 INFO L87 Difference]: Start difference. First operand 602 states and 694 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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-17 02:56:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:24,005 INFO L93 Difference]: Finished difference Result 696 states and 782 transitions. [2024-11-17 02:56:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:56:24,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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 33 [2024-11-17 02:56:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:24,008 INFO L225 Difference]: With dead ends: 696 [2024-11-17 02:56:24,008 INFO L226 Difference]: Without dead ends: 696 [2024-11-17 02:56:24,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-17 02:56:24,009 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 423 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:24,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1015 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:56:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-11-17 02:56:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 598. [2024-11-17 02:56:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 388 states have (on average 1.7628865979381443) internal successors, (684), 593 states have internal predecessors, (684), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 690 transitions. [2024-11-17 02:56:24,024 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 690 transitions. Word has length 33 [2024-11-17 02:56:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:24,025 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 690 transitions. [2024-11-17 02:56:24,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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-17 02:56:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 690 transitions. [2024-11-17 02:56:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-17 02:56:24,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:24,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:24,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 02:56:24,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:24,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 522026093, now seen corresponding path program 1 times [2024-11-17 02:56:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:24,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227719077] [2024-11-17 02:56:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:24,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227719077] [2024-11-17 02:56:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227719077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:24,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:24,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:56:24,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464804644] [2024-11-17 02:56:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:24,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:24,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:24,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:24,150 INFO L87 Difference]: Start difference. First operand 598 states and 690 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-17 02:56:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:24,223 INFO L93 Difference]: Finished difference Result 598 states and 686 transitions. [2024-11-17 02:56:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:56:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2024-11-17 02:56:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:24,226 INFO L225 Difference]: With dead ends: 598 [2024-11-17 02:56:24,226 INFO L226 Difference]: Without dead ends: 598 [2024-11-17 02:56:24,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-17 02:56:24,227 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 21 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:24,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1690 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:56:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-17 02:56:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2024-11-17 02:56:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 388 states have (on average 1.7525773195876289) internal successors, (680), 593 states have internal predecessors, (680), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 686 transitions. [2024-11-17 02:56:24,239 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 686 transitions. Word has length 68 [2024-11-17 02:56:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:24,241 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 686 transitions. [2024-11-17 02:56:24,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-17 02:56:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 686 transitions. [2024-11-17 02:56:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 02:56:24,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:24,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:24,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 02:56:24,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:24,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1442682971, now seen corresponding path program 1 times [2024-11-17 02:56:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516943803] [2024-11-17 02:56:24,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:24,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:24,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516943803] [2024-11-17 02:56:24,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516943803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:24,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:24,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867468061] [2024-11-17 02:56:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:24,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:24,406 INFO L87 Difference]: Start difference. First operand 598 states and 686 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-17 02:56:24,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:24,470 INFO L93 Difference]: Finished difference Result 696 states and 811 transitions. [2024-11-17 02:56:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:24,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2024-11-17 02:56:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:24,473 INFO L225 Difference]: With dead ends: 696 [2024-11-17 02:56:24,473 INFO L226 Difference]: Without dead ends: 696 [2024-11-17 02:56:24,474 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-17 02:56:24,474 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 54 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:24,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1150 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:56:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-11-17 02:56:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2024-11-17 02:56:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 486 states have (on average 1.6563786008230452) internal successors, (805), 691 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 811 transitions. [2024-11-17 02:56:24,501 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 811 transitions. Word has length 76 [2024-11-17 02:56:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:24,502 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 811 transitions. [2024-11-17 02:56:24,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-17 02:56:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 811 transitions. [2024-11-17 02:56:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-17 02:56:24,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:24,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:24,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 02:56:24,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr231REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:24,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash 767495880, now seen corresponding path program 1 times [2024-11-17 02:56:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:24,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452434391] [2024-11-17 02:56:24,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:24,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:25,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452434391] [2024-11-17 02:56:25,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452434391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:25,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:25,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 02:56:25,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716757354] [2024-11-17 02:56:25,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:25,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:56:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:56:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:56:25,021 INFO L87 Difference]: Start difference. First operand 696 states and 811 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 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-17 02:56:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:25,634 INFO L93 Difference]: Finished difference Result 658 states and 773 transitions. [2024-11-17 02:56:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:56:25,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 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 79 [2024-11-17 02:56:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:25,637 INFO L225 Difference]: With dead ends: 658 [2024-11-17 02:56:25,637 INFO L226 Difference]: Without dead ends: 658 [2024-11-17 02:56:25,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:56:25,638 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 481 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:25,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 482 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:56:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-17 02:56:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 616. [2024-11-17 02:56:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 444 states have (on average 1.545045045045045) internal successors, (686), 611 states have internal predecessors, (686), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 692 transitions. [2024-11-17 02:56:25,651 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 692 transitions. Word has length 79 [2024-11-17 02:56:25,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:25,653 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 692 transitions. [2024-11-17 02:56:25,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 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-17 02:56:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 692 transitions. [2024-11-17 02:56:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-17 02:56:25,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:25,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:25,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 02:56:25,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr224REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:25,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:25,656 INFO L85 PathProgramCache]: Analyzing trace with hash -468622416, now seen corresponding path program 1 times [2024-11-17 02:56:25,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:25,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136383920] [2024-11-17 02:56:25,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:25,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:25,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136383920] [2024-11-17 02:56:25,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136383920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:25,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:56:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305477047] [2024-11-17 02:56:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:25,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:56:25,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:56:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:56:25,939 INFO L87 Difference]: Start difference. First operand 616 states and 692 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-17 02:56:26,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:26,459 INFO L93 Difference]: Finished difference Result 615 states and 691 transitions. [2024-11-17 02:56:26,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:56:26,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2024-11-17 02:56:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:26,462 INFO L225 Difference]: With dead ends: 615 [2024-11-17 02:56:26,462 INFO L226 Difference]: Without dead ends: 615 [2024-11-17 02:56:26,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:56:26,463 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 2 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:26,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1499 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:56:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-17 02:56:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2024-11-17 02:56:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 444 states have (on average 1.5427927927927927) internal successors, (685), 610 states have internal predecessors, (685), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 691 transitions. [2024-11-17 02:56:26,475 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 691 transitions. Word has length 84 [2024-11-17 02:56:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:26,475 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 691 transitions. [2024-11-17 02:56:26,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-17 02:56:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 691 transitions. [2024-11-17 02:56:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-17 02:56:26,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:26,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:26,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 02:56:26,477 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:26,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash -468622415, now seen corresponding path program 1 times [2024-11-17 02:56:26,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:26,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584566555] [2024-11-17 02:56:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:26,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584566555] [2024-11-17 02:56:26,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584566555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:26,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:26,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:56:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194857092] [2024-11-17 02:56:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:26,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:56:26,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:26,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:56:26,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:56:26,929 INFO L87 Difference]: Start difference. First operand 615 states and 691 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-17 02:56:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:27,479 INFO L93 Difference]: Finished difference Result 614 states and 690 transitions. [2024-11-17 02:56:27,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:56:27,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2024-11-17 02:56:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:27,482 INFO L225 Difference]: With dead ends: 614 [2024-11-17 02:56:27,483 INFO L226 Difference]: Without dead ends: 614 [2024-11-17 02:56:27,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:56:27,484 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 1 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:27,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1511 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:56:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-17 02:56:27,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2024-11-17 02:56:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 443 states have (on average 1.5440180586907448) internal successors, (684), 609 states have internal predecessors, (684), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 690 transitions. [2024-11-17 02:56:27,498 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 690 transitions. Word has length 84 [2024-11-17 02:56:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:27,498 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 690 transitions. [2024-11-17 02:56:27,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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-17 02:56:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 690 transitions. [2024-11-17 02:56:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 02:56:27,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:27,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:27,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 02:56:27,499 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:27,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1474976461, now seen corresponding path program 1 times [2024-11-17 02:56:27,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:27,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211476181] [2024-11-17 02:56:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:27,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:27,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:27,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:27,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211476181] [2024-11-17 02:56:27,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211476181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:27,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:27,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:56:27,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927198404] [2024-11-17 02:56:27,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:27,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:56:27,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:27,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:56:27,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:56:27,764 INFO L87 Difference]: Start difference. First operand 614 states and 690 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:28,495 INFO L93 Difference]: Finished difference Result 626 states and 705 transitions. [2024-11-17 02:56:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 02:56:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-17 02:56:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:28,500 INFO L225 Difference]: With dead ends: 626 [2024-11-17 02:56:28,500 INFO L226 Difference]: Without dead ends: 626 [2024-11-17 02:56:28,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-17 02:56:28,501 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 10 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:28,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2313 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:56:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-17 02:56:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 620. [2024-11-17 02:56:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 448 states have (on average 1.5424107142857142) internal successors, (691), 614 states have internal predecessors, (691), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 02:56:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 700 transitions. [2024-11-17 02:56:28,511 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 700 transitions. Word has length 92 [2024-11-17 02:56:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:28,512 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 700 transitions. [2024-11-17 02:56:28,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 700 transitions. [2024-11-17 02:56:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 02:56:28,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:28,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:28,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 02:56:28,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:28,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1474976462, now seen corresponding path program 1 times [2024-11-17 02:56:28,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:28,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374390285] [2024-11-17 02:56:28,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:28,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:29,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:29,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374390285] [2024-11-17 02:56:29,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374390285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:29,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:29,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:56:29,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372831267] [2024-11-17 02:56:29,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:29,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:56:29,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:29,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:56:29,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:56:29,128 INFO L87 Difference]: Start difference. First operand 620 states and 700 transitions. Second operand has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:29,825 INFO L93 Difference]: Finished difference Result 620 states and 699 transitions. [2024-11-17 02:56:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:56:29,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-17 02:56:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:29,828 INFO L225 Difference]: With dead ends: 620 [2024-11-17 02:56:29,828 INFO L226 Difference]: Without dead ends: 620 [2024-11-17 02:56:29,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:56:29,829 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 5 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:29,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2353 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:56:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-17 02:56:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2024-11-17 02:56:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 448 states have (on average 1.5401785714285714) internal successors, (690), 614 states have internal predecessors, (690), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 02:56:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 699 transitions. [2024-11-17 02:56:29,840 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 699 transitions. Word has length 92 [2024-11-17 02:56:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:29,840 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 699 transitions. [2024-11-17 02:56:29,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 699 transitions. [2024-11-17 02:56:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-17 02:56:29,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:29,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:29,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 02:56:29,842 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:29,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash 978680121, now seen corresponding path program 1 times [2024-11-17 02:56:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076479993] [2024-11-17 02:56:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:30,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:30,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:30,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076479993] [2024-11-17 02:56:30,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076479993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:30,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253985785] [2024-11-17 02:56:30,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:30,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:56:30,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:56:30,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:56:30,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 02:56:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:30,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 02:56:30,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:30,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:30,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:56:30,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:56:30,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:56:30,866 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:30,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:56:30,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:56:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:30,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:56:30,948 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-17 02:56:30,949 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 21 treesize of output 20 [2024-11-17 02:56:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253985785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:30,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:56:30,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-17 02:56:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025759393] [2024-11-17 02:56:30,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:56:30,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:56:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:30,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:56:30,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=196, Unknown=6, NotChecked=0, Total=240 [2024-11-17 02:56:30,992 INFO L87 Difference]: Start difference. First operand 620 states and 699 transitions. Second operand has 15 states, 13 states have (on average 10.461538461538462) internal successors, (136), 13 states have internal predecessors, (136), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:56:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:32,527 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-17 02:56:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:56:32,528 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 10.461538461538462) internal successors, (136), 13 states have internal predecessors, (136), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-17 02:56:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:32,530 INFO L225 Difference]: With dead ends: 619 [2024-11-17 02:56:32,530 INFO L226 Difference]: Without dead ends: 619 [2024-11-17 02:56:32,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=453, Unknown=6, NotChecked=0, Total=552 [2024-11-17 02:56:32,531 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 485 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 2749 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 3393 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:32,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 3393 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2749 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:56:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-17 02:56:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2024-11-17 02:56:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 448 states have (on average 1.5379464285714286) internal successors, (689), 613 states have internal predecessors, (689), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 02:56:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 698 transitions. [2024-11-17 02:56:32,543 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 698 transitions. Word has length 93 [2024-11-17 02:56:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:32,543 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 698 transitions. [2024-11-17 02:56:32,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 10.461538461538462) internal successors, (136), 13 states have internal predecessors, (136), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:56:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 698 transitions. [2024-11-17 02:56:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-17 02:56:32,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:32,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:32,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 02:56:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 02:56:32,747 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:32,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:32,747 INFO L85 PathProgramCache]: Analyzing trace with hash 978680122, now seen corresponding path program 1 times [2024-11-17 02:56:32,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:32,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848863211] [2024-11-17 02:56:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:33,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:33,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:33,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848863211] [2024-11-17 02:56:33,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848863211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:33,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961735249] [2024-11-17 02:56:33,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:33,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:56:33,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:56:33,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:56:33,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 02:56:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:33,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 02:56:33,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:33,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:33,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:56:33,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:56:33,889 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 8 treesize of output 1 [2024-11-17 02:56:33,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 02:56:33,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:56:34,027 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 22 treesize of output 10 [2024-11-17 02:56:34,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:56:34,161 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:34,162 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 62 treesize of output 57 [2024-11-17 02:56:34,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:56:34,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:56:34,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:56:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:34,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:56:34,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_645 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:56:34,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961735249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:34,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:56:34,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-17 02:56:34,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498883064] [2024-11-17 02:56:34,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:56:34,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 02:56:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:34,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 02:56:34,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-17 02:56:34,335 INFO L87 Difference]: Start difference. First operand 619 states and 698 transitions. Second operand has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:56:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:35,827 INFO L93 Difference]: Finished difference Result 626 states and 705 transitions. [2024-11-17 02:56:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:56:35,828 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2024-11-17 02:56:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:35,830 INFO L225 Difference]: With dead ends: 626 [2024-11-17 02:56:35,830 INFO L226 Difference]: Without dead ends: 626 [2024-11-17 02:56:35,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-17 02:56:35,832 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 481 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 2969 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:35,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2615 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2969 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:56:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-17 02:56:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 617. [2024-11-17 02:56:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 447 states have (on average 1.5369127516778522) internal successors, (687), 611 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 693 transitions. [2024-11-17 02:56:35,861 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 693 transitions. Word has length 93 [2024-11-17 02:56:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:35,862 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 693 transitions. [2024-11-17 02:56:35,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:56:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 693 transitions. [2024-11-17 02:56:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:56:35,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:35,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:35,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 02:56:36,065 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,SelfDestructingSolverStorable16 [2024-11-17 02:56:36,066 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:36,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash -786202023, now seen corresponding path program 1 times [2024-11-17 02:56:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:36,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052766347] [2024-11-17 02:56:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:36,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:36,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:36,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:36,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052766347] [2024-11-17 02:56:36,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052766347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:36,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:36,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:56:36,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565336103] [2024-11-17 02:56:36,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:36,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:56:36,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:36,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:56:36,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:56:36,534 INFO L87 Difference]: Start difference. First operand 617 states and 693 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:37,854 INFO L93 Difference]: Finished difference Result 630 states and 709 transitions. [2024-11-17 02:56:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:56:37,855 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-17 02:56:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:37,857 INFO L225 Difference]: With dead ends: 630 [2024-11-17 02:56:37,857 INFO L226 Difference]: Without dead ends: 630 [2024-11-17 02:56:37,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-17 02:56:37,859 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 492 mSDsluCounter, 3056 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 3379 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:37,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 3379 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2774 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 02:56:37,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-17 02:56:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 626. [2024-11-17 02:56:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 455 states have (on average 1.531868131868132) internal successors, (697), 619 states have internal predecessors, (697), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:56:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 704 transitions. [2024-11-17 02:56:37,872 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 704 transitions. Word has length 95 [2024-11-17 02:56:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:37,872 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 704 transitions. [2024-11-17 02:56:37,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 704 transitions. [2024-11-17 02:56:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:56:37,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:37,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:37,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 02:56:37,874 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:37,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -786202022, now seen corresponding path program 1 times [2024-11-17 02:56:37,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:37,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953117539] [2024-11-17 02:56:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:37,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:38,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:38,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:38,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953117539] [2024-11-17 02:56:38,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953117539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:38,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:38,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 02:56:38,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386092909] [2024-11-17 02:56:38,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:38,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 02:56:38,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:38,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 02:56:38,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-17 02:56:38,568 INFO L87 Difference]: Start difference. First operand 626 states and 704 transitions. Second operand has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:39,713 INFO L93 Difference]: Finished difference Result 629 states and 708 transitions. [2024-11-17 02:56:39,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 02:56:39,713 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-17 02:56:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:39,716 INFO L225 Difference]: With dead ends: 629 [2024-11-17 02:56:39,716 INFO L226 Difference]: Without dead ends: 629 [2024-11-17 02:56:39,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:56:39,717 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 491 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:39,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2155 Invalid, 2320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:56:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-17 02:56:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2024-11-17 02:56:39,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 455 states have (on average 1.5296703296703296) internal successors, (696), 619 states have internal predecessors, (696), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:56:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 703 transitions. [2024-11-17 02:56:39,730 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 703 transitions. Word has length 95 [2024-11-17 02:56:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:39,731 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 703 transitions. [2024-11-17 02:56:39,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 703 transitions. [2024-11-17 02:56:39,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 02:56:39,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:39,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:39,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 02:56:39,733 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:39,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1621933165, now seen corresponding path program 1 times [2024-11-17 02:56:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:39,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565252251] [2024-11-17 02:56:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:39,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:40,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565252251] [2024-11-17 02:56:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565252251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171354012] [2024-11-17 02:56:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:40,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:56:40,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:56:40,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:56:40,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 02:56:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:40,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 02:56:40,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:40,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:40,528 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:56:40,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:56:40,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:56:40,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:40,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:56:40,672 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:40,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:56:40,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:56:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:40,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:56:40,721 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_900) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-17 02:56:40,734 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_900) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 02:56:40,769 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-17 02:56:40,769 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 33 treesize of output 32 [2024-11-17 02:56:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171354012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:40,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:56:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2024-11-17 02:56:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125463857] [2024-11-17 02:56:40,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:56:40,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 02:56:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:40,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 02:56:40,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=286, Unknown=7, NotChecked=70, Total=420 [2024-11-17 02:56:40,805 INFO L87 Difference]: Start difference. First operand 626 states and 703 transitions. Second operand has 18 states, 16 states have (on average 9.125) internal successors, (146), 17 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:56:42,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:42,011 INFO L93 Difference]: Finished difference Result 628 states and 707 transitions. [2024-11-17 02:56:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:56:42,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 9.125) internal successors, (146), 17 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-17 02:56:42,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:42,013 INFO L225 Difference]: With dead ends: 628 [2024-11-17 02:56:42,013 INFO L226 Difference]: Without dead ends: 628 [2024-11-17 02:56:42,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=587, Unknown=7, NotChecked=102, Total=812 [2024-11-17 02:56:42,014 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 479 mSDsluCounter, 2782 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:42,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 3105 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:56:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-17 02:56:42,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 625. [2024-11-17 02:56:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 455 states have (on average 1.5274725274725274) internal successors, (695), 618 states have internal predecessors, (695), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:56:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 702 transitions. [2024-11-17 02:56:42,024 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 702 transitions. Word has length 96 [2024-11-17 02:56:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:42,025 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 702 transitions. [2024-11-17 02:56:42,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 9.125) internal successors, (146), 17 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:56:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 702 transitions. [2024-11-17 02:56:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 02:56:42,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:42,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:42,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 02:56:42,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:56:42,227 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:42,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1621933166, now seen corresponding path program 1 times [2024-11-17 02:56:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44324676] [2024-11-17 02:56:42,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:43,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:43,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44324676] [2024-11-17 02:56:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44324676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:43,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816103937] [2024-11-17 02:56:43,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:43,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:56:43,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:56:43,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:56:43,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 02:56:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:43,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 02:56:43,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:43,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:43,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 02:56:43,392 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:56:43,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:56:43,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:56:43,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 02:56:43,502 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 22 treesize of output 10 [2024-11-17 02:56:43,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:56:43,597 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:43,598 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 62 treesize of output 57 [2024-11-17 02:56:43,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:56:43,675 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:43,675 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 62 treesize of output 57 [2024-11-17 02:56:43,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:56:43,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:56:43,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:56:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:43,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:56:43,789 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1047 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:56:43,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1047 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-17 02:56:43,858 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1052))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1053) .cse0 v_ArrVal_1047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1053) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-17 02:56:43,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816103937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:43,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:56:43,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-17 02:56:43,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329126179] [2024-11-17 02:56:43,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:56:43,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 02:56:43,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:43,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 02:56:43,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=437, Unknown=3, NotChecked=132, Total=650 [2024-11-17 02:56:43,862 INFO L87 Difference]: Start difference. First operand 625 states and 702 transitions. Second operand has 21 states, 18 states have (on average 8.5) internal successors, (153), 20 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:56:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:45,554 INFO L93 Difference]: Finished difference Result 627 states and 706 transitions. [2024-11-17 02:56:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:56:45,554 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.5) internal successors, (153), 20 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-17 02:56:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:45,557 INFO L225 Difference]: With dead ends: 627 [2024-11-17 02:56:45,557 INFO L226 Difference]: Without dead ends: 627 [2024-11-17 02:56:45,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=693, Unknown=3, NotChecked=168, Total=992 [2024-11-17 02:56:45,558 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 483 mSDsluCounter, 2778 mSDsCounter, 0 mSdLazyCounter, 3583 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:45,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 3103 Invalid, 3603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3583 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:56:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-17 02:56:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 615. [2024-11-17 02:56:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 447 states have (on average 1.5324384787472036) internal successors, (685), 609 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 691 transitions. [2024-11-17 02:56:45,568 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 691 transitions. Word has length 96 [2024-11-17 02:56:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:45,568 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 691 transitions. [2024-11-17 02:56:45,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.5) internal successors, (153), 20 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:56:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 691 transitions. [2024-11-17 02:56:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 02:56:45,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:45,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:45,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 02:56:45,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:56:45,771 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:45,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1287355354, now seen corresponding path program 1 times [2024-11-17 02:56:45,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:45,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563668108] [2024-11-17 02:56:45,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:45,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:46,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:46,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:46,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563668108] [2024-11-17 02:56:46,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563668108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:46,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:46,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 02:56:46,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146114667] [2024-11-17 02:56:46,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:46,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:56:46,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:46,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:56:46,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-17 02:56:46,325 INFO L87 Difference]: Start difference. First operand 615 states and 691 transitions. Second operand has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:47,627 INFO L93 Difference]: Finished difference Result 631 states and 710 transitions. [2024-11-17 02:56:47,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:56:47,628 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-17 02:56:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:47,631 INFO L225 Difference]: With dead ends: 631 [2024-11-17 02:56:47,632 INFO L226 Difference]: Without dead ends: 631 [2024-11-17 02:56:47,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-17 02:56:47,633 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 512 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 2769 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 3396 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:47,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 3396 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2769 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 02:56:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-17 02:56:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 627. [2024-11-17 02:56:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 458 states have (on average 1.5240174672489082) internal successors, (698), 620 states have internal predecessors, (698), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:56:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 705 transitions. [2024-11-17 02:56:47,648 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 705 transitions. Word has length 98 [2024-11-17 02:56:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:47,648 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 705 transitions. [2024-11-17 02:56:47,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 705 transitions. [2024-11-17 02:56:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 02:56:47,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:47,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:47,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 02:56:47,650 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:47,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:47,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1287355353, now seen corresponding path program 1 times [2024-11-17 02:56:47,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:47,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912080544] [2024-11-17 02:56:47,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:47,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:48,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:48,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912080544] [2024-11-17 02:56:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912080544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:48,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 02:56:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154726660] [2024-11-17 02:56:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:48,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 02:56:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:48,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 02:56:48,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-17 02:56:48,407 INFO L87 Difference]: Start difference. First operand 627 states and 705 transitions. Second operand has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:49,523 INFO L93 Difference]: Finished difference Result 630 states and 709 transitions. [2024-11-17 02:56:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:56:49,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-17 02:56:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:49,526 INFO L225 Difference]: With dead ends: 630 [2024-11-17 02:56:49,526 INFO L226 Difference]: Without dead ends: 630 [2024-11-17 02:56:49,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-17 02:56:49,527 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 510 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:49,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 2196 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:56:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-17 02:56:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 627. [2024-11-17 02:56:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 458 states have (on average 1.5218340611353711) internal successors, (697), 620 states have internal predecessors, (697), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:56:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 704 transitions. [2024-11-17 02:56:49,536 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 704 transitions. Word has length 98 [2024-11-17 02:56:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:49,536 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 704 transitions. [2024-11-17 02:56:49,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:49,537 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 704 transitions. [2024-11-17 02:56:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:56:49,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:49,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:49,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 02:56:49,538 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash 629285266, now seen corresponding path program 1 times [2024-11-17 02:56:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470821278] [2024-11-17 02:56:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:50,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470821278] [2024-11-17 02:56:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470821278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182974232] [2024-11-17 02:56:50,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:50,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:56:50,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:56:50,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:56:50,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 02:56:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:50,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 02:56:50,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:50,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:50,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:56:50,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:56:50,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:56:50,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:50,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:56:50,566 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:50,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:56:50,612 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:50,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:56:50,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:56:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:50,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:56:50,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1333 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1333) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-17 02:56:50,637 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1333 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 02:56:50,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1332))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1333)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:56:50,698 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-17 02:56:50,698 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 57 treesize of output 56 [2024-11-17 02:56:50,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1336))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1332)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1333)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2024-11-17 02:56:50,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182974232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:50,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:56:50,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-17 02:56:50,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521157412] [2024-11-17 02:56:50,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:56:50,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 02:56:50,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:50,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 02:56:50,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=359, Unknown=5, NotChecked=164, Total=600 [2024-11-17 02:56:50,707 INFO L87 Difference]: Start difference. First operand 627 states and 704 transitions. Second operand has 20 states, 18 states have (on average 8.38888888888889) internal successors, (151), 19 states have internal predecessors, (151), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:56:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:51,974 INFO L93 Difference]: Finished difference Result 629 states and 708 transitions. [2024-11-17 02:56:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:56:51,975 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.38888888888889) internal successors, (151), 19 states have internal predecessors, (151), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-11-17 02:56:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:51,976 INFO L225 Difference]: With dead ends: 629 [2024-11-17 02:56:51,976 INFO L226 Difference]: Without dead ends: 629 [2024-11-17 02:56:51,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=737, Unknown=5, NotChecked=236, Total=1122 [2024-11-17 02:56:51,977 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 477 mSDsluCounter, 3390 mSDsCounter, 0 mSdLazyCounter, 2982 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 3712 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:51,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 3712 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2982 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:56:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-17 02:56:51,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2024-11-17 02:56:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 458 states have (on average 1.519650655021834) internal successors, (696), 619 states have internal predecessors, (696), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:56:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 703 transitions. [2024-11-17 02:56:51,987 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 703 transitions. Word has length 99 [2024-11-17 02:56:51,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:51,987 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 703 transitions. [2024-11-17 02:56:51,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.38888888888889) internal successors, (151), 19 states have internal predecessors, (151), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:56:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 703 transitions. [2024-11-17 02:56:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:56:51,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:51,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:52,007 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-17 02:56:52,189 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,SelfDestructingSolverStorable23 [2024-11-17 02:56:52,189 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:52,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 629285267, now seen corresponding path program 1 times [2024-11-17 02:56:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:52,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404359279] [2024-11-17 02:56:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:52,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:52,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:52,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:52,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404359279] [2024-11-17 02:56:52,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404359279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:52,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217599380] [2024-11-17 02:56:52,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:52,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:56:52,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:56:52,951 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:56:52,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 02:56:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:53,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-17 02:56:53,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:53,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:53,246 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:56:53,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:56:53,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 02:56:53,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 19 treesize of output 1 [2024-11-17 02:56:53,399 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:53,400 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 62 treesize of output 57 [2024-11-17 02:56:53,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:56:53,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:53,485 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 62 treesize of output 57 [2024-11-17 02:56:53,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:56:53,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:56:53,532 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 62 treesize of output 57 [2024-11-17 02:56:53,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 30 treesize of output 13 [2024-11-17 02:56:53,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:56:53,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:56:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:53,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:56:53,634 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1494 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:56:53,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1494 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-17 02:56:53,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1491))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1492) .cse0 v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1492) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-17 02:56:53,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1492) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1491))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1492) .cse2 v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-17 02:56:53,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 02:56:53,745 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 156 treesize of output 160 [2024-11-17 02:56:53,815 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1500))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1499) .cse0 v_ArrVal_1492) (select (select (store .cse1 .cse0 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1494))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_5))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_9)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1493)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~mem51#1.base|)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_5))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_6) .cse5 v_prenex_8) (select (select (store .cse6 .cse5 v_prenex_9) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_7))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 33 |c_ULTIMATE.start_main_#t~mem51#1.offset|))))) is different from false [2024-11-17 02:56:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217599380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:53,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:56:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2024-11-17 02:56:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476081469] [2024-11-17 02:56:53,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:56:53,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 02:56:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:53,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 02:56:53,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=567, Unknown=5, NotChecked=260, Total=930 [2024-11-17 02:56:53,820 INFO L87 Difference]: Start difference. First operand 626 states and 703 transitions. Second operand has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:56:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:55,731 INFO L93 Difference]: Finished difference Result 628 states and 707 transitions. [2024-11-17 02:56:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:56:55,731 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-17 02:56:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:55,733 INFO L225 Difference]: With dead ends: 628 [2024-11-17 02:56:55,733 INFO L226 Difference]: Without dead ends: 628 [2024-11-17 02:56:55,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=908, Unknown=5, NotChecked=330, Total=1406 [2024-11-17 02:56:55,734 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 473 mSDsluCounter, 3732 mSDsCounter, 0 mSdLazyCounter, 4267 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 4053 SdHoareTripleChecker+Invalid, 4284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:55,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 4053 Invalid, 4284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4267 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 02:56:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-17 02:56:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 613. [2024-11-17 02:56:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 447 states have (on average 1.5279642058165548) internal successors, (683), 607 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 689 transitions. [2024-11-17 02:56:55,742 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 689 transitions. Word has length 99 [2024-11-17 02:56:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:55,743 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 689 transitions. [2024-11-17 02:56:55,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:56:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 689 transitions. [2024-11-17 02:56:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 02:56:55,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:55,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:55,763 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-17 02:56:55,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:56:55,945 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:55,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1839925230, now seen corresponding path program 1 times [2024-11-17 02:56:55,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:55,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627006178] [2024-11-17 02:56:55,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:55,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:56,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627006178] [2024-11-17 02:56:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627006178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:56,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:56,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-17 02:56:56,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096550712] [2024-11-17 02:56:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:56,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 02:56:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:56,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 02:56:56,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:56:56,551 INFO L87 Difference]: Start difference. First operand 613 states and 689 transitions. Second operand has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:57,484 INFO L93 Difference]: Finished difference Result 632 states and 711 transitions. [2024-11-17 02:56:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:56:57,485 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-17 02:56:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:57,486 INFO L225 Difference]: With dead ends: 632 [2024-11-17 02:56:57,487 INFO L226 Difference]: Without dead ends: 632 [2024-11-17 02:56:57,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-17 02:56:57,487 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 519 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:57,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 2481 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:56:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-17 02:56:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 628. [2024-11-17 02:56:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 461 states have (on average 1.5162689804772234) internal successors, (699), 621 states have internal predecessors, (699), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:56:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 706 transitions. [2024-11-17 02:56:57,495 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 706 transitions. Word has length 101 [2024-11-17 02:56:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:57,496 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 706 transitions. [2024-11-17 02:56:57,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 706 transitions. [2024-11-17 02:56:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 02:56:57,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:57,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:57,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 02:56:57,497 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:57,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1839925229, now seen corresponding path program 1 times [2024-11-17 02:56:57,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:57,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375196957] [2024-11-17 02:56:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:58,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:58,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375196957] [2024-11-17 02:56:58,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375196957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:58,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:58,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:56:58,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110227845] [2024-11-17 02:56:58,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:58,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:56:58,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:56:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:56:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:56:58,273 INFO L87 Difference]: Start difference. First operand 628 states and 706 transitions. Second operand has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:59,138 INFO L93 Difference]: Finished difference Result 631 states and 710 transitions. [2024-11-17 02:56:59,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 02:56:59,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-17 02:56:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:59,141 INFO L225 Difference]: With dead ends: 631 [2024-11-17 02:56:59,141 INFO L226 Difference]: Without dead ends: 631 [2024-11-17 02:56:59,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-17 02:56:59,141 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 512 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:59,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1653 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:56:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-17 02:56:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 628. [2024-11-17 02:56:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 461 states have (on average 1.5140997830802603) internal successors, (698), 621 states have internal predecessors, (698), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:56:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 705 transitions. [2024-11-17 02:56:59,148 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 705 transitions. Word has length 101 [2024-11-17 02:56:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:59,148 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 705 transitions. [2024-11-17 02:56:59,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:56:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 705 transitions. [2024-11-17 02:56:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:56:59,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:59,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:59,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 02:56:59,150 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:56:59,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash -494447834, now seen corresponding path program 1 times [2024-11-17 02:56:59,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:56:59,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338772237] [2024-11-17 02:56:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:56:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:59,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:56:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:59,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:56:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338772237] [2024-11-17 02:56:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338772237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:56:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356488036] [2024-11-17 02:56:59,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:59,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:56:59,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:56:59,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:56:59,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 02:56:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:59,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-17 02:56:59,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:59,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:57:00,060 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:57:00,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:57:00,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:57:00,143 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:00,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:57:00,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:00,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:57:00,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:00,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:57:00,268 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:00,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:57:00,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:57:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:00,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:57:00,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1805) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-17 02:57:00,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 02:57:00,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 (Array Int Int)) (v_ArrVal_1804 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1803))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1804)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:57:00,446 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-17 02:57:00,447 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 105 treesize of output 104 [2024-11-17 02:57:00,455 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1808 (Array Int Int)) (v_ArrVal_1805 (Array Int Int)) (v_ArrVal_1804 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1808))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1804)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-17 02:57:00,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356488036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:57:00,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:57:00,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2024-11-17 02:57:00,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781841993] [2024-11-17 02:57:00,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:57:00,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 02:57:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:57:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 02:57:00,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=488, Unknown=32, NotChecked=196, Total=812 [2024-11-17 02:57:00,459 INFO L87 Difference]: Start difference. First operand 628 states and 705 transitions. Second operand has 22 states, 20 states have (on average 7.8) internal successors, (156), 21 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:57:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:01,660 INFO L93 Difference]: Finished difference Result 630 states and 709 transitions. [2024-11-17 02:57:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:57:01,660 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.8) internal successors, (156), 21 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-11-17 02:57:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:01,662 INFO L225 Difference]: With dead ends: 630 [2024-11-17 02:57:01,662 INFO L226 Difference]: Without dead ends: 630 [2024-11-17 02:57:01,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=981, Unknown=39, NotChecked=276, Total=1482 [2024-11-17 02:57:01,663 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 473 mSDsluCounter, 2448 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:01,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 2769 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:57:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-17 02:57:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 627. [2024-11-17 02:57:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 461 states have (on average 1.5119305856832972) internal successors, (697), 620 states have internal predecessors, (697), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 704 transitions. [2024-11-17 02:57:01,671 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 704 transitions. Word has length 102 [2024-11-17 02:57:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:01,671 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 704 transitions. [2024-11-17 02:57:01,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.8) internal successors, (156), 21 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:57:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 704 transitions. [2024-11-17 02:57:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:57:01,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:01,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:57:01,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-17 02:57:01,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:57:01,873 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:57:01,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:01,874 INFO L85 PathProgramCache]: Analyzing trace with hash -494447833, now seen corresponding path program 1 times [2024-11-17 02:57:01,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:57:01,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122786091] [2024-11-17 02:57:01,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:01,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:57:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:02,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:57:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:57:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122786091] [2024-11-17 02:57:02,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122786091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:57:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936842507] [2024-11-17 02:57:02,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:02,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:57:02,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:57:02,803 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:57:02,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 02:57:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:03,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-17 02:57:03,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:03,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:57:03,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 02:57:03,111 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:57:03,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:57:03,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:57:03,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:57:03,211 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 22 treesize of output 10 [2024-11-17 02:57:03,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:57:03,292 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:03,293 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 62 treesize of output 57 [2024-11-17 02:57:03,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:57:03,362 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:03,362 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 62 treesize of output 57 [2024-11-17 02:57:03,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:57:03,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:03,411 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 62 treesize of output 57 [2024-11-17 02:57:03,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:57:03,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:03,475 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 62 treesize of output 57 [2024-11-17 02:57:03,481 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 41 treesize of output 22 [2024-11-17 02:57:03,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:57:03,527 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 30 treesize of output 12 [2024-11-17 02:57:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:03,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:57:03,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1978 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1978))) (or (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1979 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1977))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8) 0)))) (forall ((v_ArrVal_1978 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1978))) (or (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1980 (Array Int Int))) (<= 0 (+ 20 (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8) 0))))))) is different from false [2024-11-17 02:57:03,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1976) .cse2 v_ArrVal_1978))) (or (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1980 (Array Int Int))) (<= 0 (+ 20 (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 8) 0)))))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1976) .cse8 v_ArrVal_1978))) (or (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1979 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1977))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 24 (select (select (store .cse4 .cse5 v_ArrVal_1980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 8) 0)))))))) is different from false [2024-11-17 02:57:04,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1985 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1986))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_1975))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1985) .cse6 v_ArrVal_1976) .cse5 v_ArrVal_1978))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1979 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1977))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1985 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1986))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse12 .cse11 v_ArrVal_1975))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1985) .cse11 v_ArrVal_1976) .cse10 v_ArrVal_1978))) (or (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1980 (Array Int Int))) (<= 0 (+ (select (select (store .cse8 (select (select (store .cse9 .cse10 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (< (+ (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0)))))))))) is different from false [2024-11-17 02:57:04,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936842507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:57:04,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:57:04,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-17 02:57:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397146899] [2024-11-17 02:57:04,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:57:04,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:57:04,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:57:04,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:57:04,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=855, Unknown=21, NotChecked=186, Total=1190 [2024-11-17 02:57:04,094 INFO L87 Difference]: Start difference. First operand 627 states and 704 transitions. Second operand has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:57:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:07,034 INFO L93 Difference]: Finished difference Result 629 states and 708 transitions. [2024-11-17 02:57:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:57:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2024-11-17 02:57:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:07,037 INFO L225 Difference]: With dead ends: 629 [2024-11-17 02:57:07,037 INFO L226 Difference]: Without dead ends: 629 [2024-11-17 02:57:07,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1484, Unknown=21, NotChecked=246, Total=1980 [2024-11-17 02:57:07,038 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 482 mSDsluCounter, 4337 mSDsCounter, 0 mSdLazyCounter, 5858 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 4656 SdHoareTripleChecker+Invalid, 5878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:07,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 4656 Invalid, 5878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5858 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-17 02:57:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-17 02:57:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 611. [2024-11-17 02:57:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 447 states have (on average 1.523489932885906) internal successors, (681), 605 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:57:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 687 transitions. [2024-11-17 02:57:07,046 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 687 transitions. Word has length 102 [2024-11-17 02:57:07,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:07,046 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 687 transitions. [2024-11-17 02:57:07,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:57:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 687 transitions. [2024-11-17 02:57:07,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 02:57:07,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:07,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:57:07,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-17 02:57:07,248 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,SelfDestructingSolverStorable28 [2024-11-17 02:57:07,248 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:57:07,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash -253534132, now seen corresponding path program 1 times [2024-11-17 02:57:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:57:07,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106949038] [2024-11-17 02:57:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:57:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:07,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:57:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:07,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:57:07,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106949038] [2024-11-17 02:57:07,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106949038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:07,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:07,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-17 02:57:07,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106004278] [2024-11-17 02:57:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:07,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 02:57:07,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:57:07,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 02:57:07,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-17 02:57:07,913 INFO L87 Difference]: Start difference. First operand 611 states and 687 transitions. Second operand has 17 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:57:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:09,042 INFO L93 Difference]: Finished difference Result 634 states and 713 transitions. [2024-11-17 02:57:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:57:09,042 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-17 02:57:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:09,044 INFO L225 Difference]: With dead ends: 634 [2024-11-17 02:57:09,044 INFO L226 Difference]: Without dead ends: 634 [2024-11-17 02:57:09,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-17 02:57:09,046 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 495 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:09,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 3083 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:57:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-17 02:57:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 630. [2024-11-17 02:57:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 465 states have (on average 1.5075268817204301) internal successors, (701), 623 states have internal predecessors, (701), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 708 transitions. [2024-11-17 02:57:09,055 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 708 transitions. Word has length 105 [2024-11-17 02:57:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:09,056 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 708 transitions. [2024-11-17 02:57:09,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:57:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 708 transitions. [2024-11-17 02:57:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 02:57:09,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:09,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:57:09,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-17 02:57:09,057 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:57:09,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:09,057 INFO L85 PathProgramCache]: Analyzing trace with hash -253534131, now seen corresponding path program 1 times [2024-11-17 02:57:09,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:57:09,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793955220] [2024-11-17 02:57:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:09,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:57:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:10,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:57:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:10,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:57:10,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793955220] [2024-11-17 02:57:10,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793955220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:10,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:10,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-17 02:57:10,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977684954] [2024-11-17 02:57:10,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:10,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 02:57:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:57:10,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 02:57:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-17 02:57:10,259 INFO L87 Difference]: Start difference. First operand 630 states and 708 transitions. Second operand has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:57:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:12,086 INFO L93 Difference]: Finished difference Result 633 states and 712 transitions. [2024-11-17 02:57:12,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:57:12,086 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-17 02:57:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:12,088 INFO L225 Difference]: With dead ends: 633 [2024-11-17 02:57:12,088 INFO L226 Difference]: Without dead ends: 633 [2024-11-17 02:57:12,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-17 02:57:12,089 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 497 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 3410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:12,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2776 Invalid, 3410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3391 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:57:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-17 02:57:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-17 02:57:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 465 states have (on average 1.5053763440860215) internal successors, (700), 623 states have internal predecessors, (700), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 707 transitions. [2024-11-17 02:57:12,096 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 707 transitions. Word has length 105 [2024-11-17 02:57:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:12,096 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 707 transitions. [2024-11-17 02:57:12,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:57:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 707 transitions. [2024-11-17 02:57:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-17 02:57:12,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:12,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:57:12,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-17 02:57:12,098 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:57:12,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:12,099 INFO L85 PathProgramCache]: Analyzing trace with hash -611708576, now seen corresponding path program 1 times [2024-11-17 02:57:12,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:57:12,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602105332] [2024-11-17 02:57:12,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:12,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:57:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:12,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:57:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:12,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:12,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:57:12,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602105332] [2024-11-17 02:57:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602105332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:57:12,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785446190] [2024-11-17 02:57:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:12,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:57:12,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:57:12,718 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:57:12,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 02:57:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:12,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 02:57:12,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:12,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:57:13,072 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:57:13,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:57:13,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:57:13,137 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:13,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:57:13,162 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:13,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:57:13,201 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:13,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:57:13,246 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:13,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:57:13,284 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:13,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:57:13,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:57:13,307 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 02:57:13,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-17 02:57:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:13,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:57:13,810 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-17 02:57:13,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-17 02:57:13,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2328 (Array Int Int)) (v_ArrVal_2324 (Array Int Int)) (v_ArrVal_2323 (Array Int Int)) (v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2328))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2321)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2322)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2323)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2324)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2024-11-17 02:57:13,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785446190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:57:13,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:57:13,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 21 [2024-11-17 02:57:13,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998122234] [2024-11-17 02:57:13,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:57:13,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 02:57:13,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:57:13,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 02:57:13,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=813, Unknown=44, NotChecked=60, Total=1056 [2024-11-17 02:57:13,830 INFO L87 Difference]: Start difference. First operand 630 states and 707 transitions. Second operand has 22 states, 20 states have (on average 7.75) internal successors, (155), 20 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:57:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:15,150 INFO L93 Difference]: Finished difference Result 632 states and 711 transitions. [2024-11-17 02:57:15,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 02:57:15,150 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.75) internal successors, (155), 20 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-17 02:57:15,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:15,152 INFO L225 Difference]: With dead ends: 632 [2024-11-17 02:57:15,152 INFO L226 Difference]: Without dead ends: 632 [2024-11-17 02:57:15,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=1502, Unknown=44, NotChecked=82, Total=1892 [2024-11-17 02:57:15,153 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 474 mSDsluCounter, 3067 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:15,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3387 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:57:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-17 02:57:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-17 02:57:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 465 states have (on average 1.5032258064516129) internal successors, (699), 622 states have internal predecessors, (699), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 706 transitions. [2024-11-17 02:57:15,160 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 706 transitions. Word has length 106 [2024-11-17 02:57:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:15,160 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 706 transitions. [2024-11-17 02:57:15,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.75) internal successors, (155), 20 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:57:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 706 transitions. [2024-11-17 02:57:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-17 02:57:15,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:15,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:57:15,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-17 02:57:15,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:57:15,362 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:57:15,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:15,362 INFO L85 PathProgramCache]: Analyzing trace with hash -611708575, now seen corresponding path program 1 times [2024-11-17 02:57:15,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:57:15,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814919318] [2024-11-17 02:57:15,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:15,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:57:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:16,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:57:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:16,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:57:16,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814919318] [2024-11-17 02:57:16,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814919318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:57:16,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606594908] [2024-11-17 02:57:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:16,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:57:16,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:57:16,401 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:57:16,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 02:57:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:16,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-17 02:57:16,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:16,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:57:16,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 02:57:16,750 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:57:16,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:57:16,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:57:16,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 02:57:16,792 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 22 treesize of output 10 [2024-11-17 02:57:16,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:57:16,906 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:16,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-17 02:57:16,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:57:16,972 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:16,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-17 02:57:16,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:57:17,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:17,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-17 02:57:17,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:57:17,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:17,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-17 02:57:17,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:57:17,162 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:17,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-17 02:57:17,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 30 treesize of output 13 [2024-11-17 02:57:17,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-17 02:57:17,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:57:17,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:57:17,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 02:57:17,212 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:57:17,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:57:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:17,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:57:17,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2515) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2518 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)) (forall ((v_ArrVal_2519 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2516))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2515) .cse1 v_ArrVal_2517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2519) (select (select (store .cse2 .cse1 v_ArrVal_2518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-17 02:57:17,529 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (or (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2515) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2518 (Array Int Int))) (or (forall ((v_ArrVal_2519 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2516))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2515) .cse2 v_ArrVal_2517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2519) (select (select (store .cse3 .cse2 v_ArrVal_2518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false [2024-11-17 02:57:17,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2513))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2514) .cse1 v_ArrVal_2515) (select (select (store .cse2 .cse1 v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2517))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)) (forall ((v_ArrVal_2519 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2513))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2516))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2514) .cse4 v_ArrVal_2515) .cse5 v_ArrVal_2517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2519) (select (select (store .cse6 .cse5 v_ArrVal_2518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-17 02:57:17,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2511 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2512))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2513))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2511) .cse0 v_ArrVal_2514) .cse1 v_ArrVal_2515) (select (select (store .cse2 .cse1 v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2517))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2511 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (or (forall ((v_ArrVal_2519 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2512))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2513))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2516))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2511) .cse5 v_ArrVal_2514) .cse6 v_ArrVal_2515) .cse7 v_ArrVal_2517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2519) (select (select (store .cse8 .cse7 v_ArrVal_2518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))))) is different from false [2024-11-17 02:57:18,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 02:57:18,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-17 02:57:18,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2519 Int) (v_prenex_26 Int) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (or (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_29))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_31))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_30))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_24))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_27) .cse0 v_prenex_32) .cse1 v_prenex_28) .cse2 v_prenex_25) .cse3 v_prenex_23) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| v_prenex_26 v_ArrVal_2519) (select (select (store .cse5 .cse3 v_ArrVal_2518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_26))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2511 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2524))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2512))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2513))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2525) .cse9 v_ArrVal_2511) .cse10 v_ArrVal_2514) .cse11 v_ArrVal_2515) (select (select (store .cse12 .cse11 v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2517))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-17 02:57:18,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606594908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:57:18,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:57:18,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2024-11-17 02:57:18,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057930306] [2024-11-17 02:57:18,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:57:18,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:57:18,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:57:18,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:57:18,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=913, Unknown=22, NotChecked=330, Total=1406 [2024-11-17 02:57:18,650 INFO L87 Difference]: Start difference. First operand 629 states and 706 transitions. Second operand has 26 states, 24 states have (on average 6.708333333333333) internal successors, (161), 24 states have internal predecessors, (161), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:57:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:20,973 INFO L93 Difference]: Finished difference Result 631 states and 710 transitions. [2024-11-17 02:57:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 02:57:20,973 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.708333333333333) internal successors, (161), 24 states have internal predecessors, (161), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 106 [2024-11-17 02:57:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:20,975 INFO L225 Difference]: With dead ends: 631 [2024-11-17 02:57:20,975 INFO L226 Difference]: Without dead ends: 631 [2024-11-17 02:57:20,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=1889, Unknown=22, NotChecked=470, Total=2652 [2024-11-17 02:57:20,976 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 476 mSDsluCounter, 2460 mSDsCounter, 0 mSdLazyCounter, 3376 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2778 SdHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:20,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2778 Invalid, 3394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3376 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:57:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-17 02:57:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 609. [2024-11-17 02:57:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 447 states have (on average 1.5190156599552573) internal successors, (679), 603 states have internal predecessors, (679), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:57:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 685 transitions. [2024-11-17 02:57:20,983 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 685 transitions. Word has length 106 [2024-11-17 02:57:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:20,983 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 685 transitions. [2024-11-17 02:57:20,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.708333333333333) internal successors, (161), 24 states have internal predecessors, (161), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:57:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 685 transitions. [2024-11-17 02:57:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-17 02:57:20,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:20,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:57:20,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-17 02:57:21,184 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,SelfDestructingSolverStorable32 [2024-11-17 02:57:21,184 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:57:21,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1812572157, now seen corresponding path program 1 times [2024-11-17 02:57:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:57:21,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897045489] [2024-11-17 02:57:21,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:57:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:21,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:57:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:21,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:57:21,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897045489] [2024-11-17 02:57:21,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897045489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:21,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:21,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-17 02:57:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92392299] [2024-11-17 02:57:21,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:21,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 02:57:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:57:21,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 02:57:21,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:57:21,710 INFO L87 Difference]: Start difference. First operand 609 states and 685 transitions. Second operand has 16 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:57:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:23,193 INFO L93 Difference]: Finished difference Result 635 states and 714 transitions. [2024-11-17 02:57:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:57:23,193 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2024-11-17 02:57:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:23,195 INFO L225 Difference]: With dead ends: 635 [2024-11-17 02:57:23,195 INFO L226 Difference]: Without dead ends: 635 [2024-11-17 02:57:23,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-17 02:57:23,196 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 497 mSDsluCounter, 3381 mSDsCounter, 0 mSdLazyCounter, 2963 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 3703 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:23,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 3703 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2963 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 02:57:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-17 02:57:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2024-11-17 02:57:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 468 states have (on average 1.5) internal successors, (702), 624 states have internal predecessors, (702), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 709 transitions. [2024-11-17 02:57:23,202 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 709 transitions. Word has length 108 [2024-11-17 02:57:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:23,203 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 709 transitions. [2024-11-17 02:57:23,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:57:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 709 transitions. [2024-11-17 02:57:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-17 02:57:23,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:23,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:57:23,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-17 02:57:23,204 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr201REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:57:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1812572158, now seen corresponding path program 1 times [2024-11-17 02:57:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:57:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637214417] [2024-11-17 02:57:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:57:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:24,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:57:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:24,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:57:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637214417] [2024-11-17 02:57:24,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637214417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:24,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:24,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-17 02:57:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933518304] [2024-11-17 02:57:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:24,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 02:57:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:57:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 02:57:24,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-17 02:57:24,132 INFO L87 Difference]: Start difference. First operand 631 states and 709 transitions. Second operand has 19 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:57:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:26,608 INFO L93 Difference]: Finished difference Result 634 states and 713 transitions. [2024-11-17 02:57:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 02:57:26,608 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2024-11-17 02:57:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:26,610 INFO L225 Difference]: With dead ends: 634 [2024-11-17 02:57:26,610 INFO L226 Difference]: Without dead ends: 634 [2024-11-17 02:57:26,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-17 02:57:26,611 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 512 mSDsluCounter, 3468 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 4477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:26,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 3788 Invalid, 4477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4461 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 02:57:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-17 02:57:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-17 02:57:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 468 states have (on average 1.4978632478632479) internal successors, (701), 624 states have internal predecessors, (701), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 708 transitions. [2024-11-17 02:57:26,619 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 708 transitions. Word has length 108 [2024-11-17 02:57:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:26,620 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 708 transitions. [2024-11-17 02:57:26,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:57:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 708 transitions. [2024-11-17 02:57:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-17 02:57:26,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:26,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:57:26,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-17 02:57:26,621 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 02:57:26,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash 136474217, now seen corresponding path program 1 times [2024-11-17 02:57:26,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:57:26,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590077624] [2024-11-17 02:57:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:26,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:57:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:27,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-17 02:57:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:27,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:57:27,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590077624] [2024-11-17 02:57:27,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590077624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:57:27,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439191702] [2024-11-17 02:57:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:27,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:57:27,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:57:27,200 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:57:27,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-17 02:57:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:27,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-17 02:57:27,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:27,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:57:27,550 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:57:27,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:57:27,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:57:27,588 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:27,589 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 31 treesize of output 32 [2024-11-17 02:57:27,617 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:27,618 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 31 treesize of output 32 [2024-11-17 02:57:27,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:27,657 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 31 treesize of output 32 [2024-11-17 02:57:27,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:27,687 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 31 treesize of output 32 [2024-11-17 02:57:27,719 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:27,720 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 31 treesize of output 32 [2024-11-17 02:57:27,745 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:27,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:57:27,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:57:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:27,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:57:27,785 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-17 02:57:27,786 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 21 treesize of output 20 [2024-11-17 02:57:27,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2887) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-17 02:57:27,845 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2886 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))))) is different from false [2024-11-17 02:57:27,857 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-17 02:57:27,861 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-17 02:57:27,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2884))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2885)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false