./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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_BER_test9-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 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:01:45,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:01:46,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:01:46,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:01:46,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:01:46,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:01:46,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:01:46,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:01:46,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:01:46,103 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:01:46,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:01:46,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:01:46,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:01:46,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:01:46,105 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:01:46,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:01:46,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:01:46,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:01:46,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:01:46,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:01:46,107 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:01:46,108 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:01:46,108 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:01:46,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:01:46,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:01:46,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:01:46,109 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:01:46,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:01:46,110 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:01:46,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:01:46,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:01:46,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:01:46,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:01:46,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:01:46,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:01:46,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:01:46,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:01:46,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:01:46,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:01:46,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:01:46,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:01:46,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:01:46,128 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 -> 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 [2024-11-09 10:01:46,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:01:46,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:01:46,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:01:46,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:01:46,431 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:01:46,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2024-11-09 10:01:47,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:01:48,357 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:01:48,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2024-11-09 10:01:48,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f05605b/54aab7703d22428aa2088e797673c8de/FLAGb40c7e0ed [2024-11-09 10:01:48,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f05605b/54aab7703d22428aa2088e797673c8de [2024-11-09 10:01:48,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:01:48,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:01:48,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:01:48,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:01:48,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:01:48,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:01:48" (1/1) ... [2024-11-09 10:01:48,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568b8520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:48, skipping insertion in model container [2024-11-09 10:01:48,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:01:48" (1/1) ... [2024-11-09 10:01:48,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:01:49,154 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:49,178 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:49,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:49,189 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:49,196 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:49,226 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:49,227 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:49,231 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:49,232 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:01:49,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:01:49,255 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:01:49,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:01:49,466 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:01:49,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49 WrapperNode [2024-11-09 10:01:49,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:01:49,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:01:49,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:01:49,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:01:49,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:49,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:49,651 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3292 [2024-11-09 10:01:49,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:01:49,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:01:49,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:01:49,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:01:49,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:49,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:49,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:49,863 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-09 10:01:49,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:49,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:49,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:49,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:49,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:49,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:50,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:01:50,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:01:50,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:01:50,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:01:50,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (1/1) ... [2024-11-09 10:01:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:01:50,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:01:50,066 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-09 10:01:50,071 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-09 10:01:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:01:50,127 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:01:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:01:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:01:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:01:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:01:50,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:01:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:01:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:01:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:01:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:01:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:01:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:01:50,130 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:01:50,130 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:01:50,131 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:01:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:01:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:01:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:01:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:01:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:01:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:01:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:01:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:01:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:01:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:01:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:01:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:01:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:01:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:01:50,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:01:50,379 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:01:50,382 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:01:50,408 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:01:50,440 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:01:50,464 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:01:53,651 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2024-11-09 10:01:53,651 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:01:53,700 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:01:53,701 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 10:01:53,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:01:53 BoogieIcfgContainer [2024-11-09 10:01:53,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:01:53,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:01:53,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:01:53,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:01:53,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:01:48" (1/3) ... [2024-11-09 10:01:53,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edb9c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:01:53, skipping insertion in model container [2024-11-09 10:01:53,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:01:49" (2/3) ... [2024-11-09 10:01:53,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edb9c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:01:53, skipping insertion in model container [2024-11-09 10:01:53,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:01:53" (3/3) ... [2024-11-09 10:01:53,712 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-1.i [2024-11-09 10:01:53,729 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:01:53,729 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-11-09 10:01:53,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:01:53,827 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;@513b0549, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:01:53,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-09 10:01:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 2066 states, 1136 states have (on average 2.007042253521127) internal successors, (2280), 2059 states have internal predecessors, (2280), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-09 10:01:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:01:53,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:53,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:01:53,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:01:53,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-09 10:01:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291561478] [2024-11-09 10:01:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:54,084 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-09 10:01:54,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:54,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291561478] [2024-11-09 10:01:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291561478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:01:54,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:01:54,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:01:54,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844534582] [2024-11-09 10:01:54,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:01:54,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:01:54,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:01:54,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:01:54,125 INFO L87 Difference]: Start difference. First operand has 2066 states, 1136 states have (on average 2.007042253521127) internal successors, (2280), 2059 states have internal predecessors, (2280), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:01:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:55,470 INFO L93 Difference]: Finished difference Result 2052 states and 3216 transitions. [2024-11-09 10:01:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:01:55,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 10:01:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:55,522 INFO L225 Difference]: With dead ends: 2052 [2024-11-09 10:01:55,523 INFO L226 Difference]: Without dead ends: 2050 [2024-11-09 10:01:55,524 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-09 10:01:55,528 INFO L432 NwaCegarLoop]: 2827 mSDtfsCounter, 2091 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:55,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 2879 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:01:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2024-11-09 10:01:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2024-11-09 10:01:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1138 states have (on average 1.9384885764499122) internal successors, (2206), 2043 states have internal predecessors, (2206), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 10:01:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3214 transitions. [2024-11-09 10:01:55,840 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3214 transitions. Word has length 3 [2024-11-09 10:01:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:55,840 INFO L471 AbstractCegarLoop]: Abstraction has 2050 states and 3214 transitions. [2024-11-09 10:01:55,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:01:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3214 transitions. [2024-11-09 10:01:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:01:55,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:55,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:01:55,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:01:55,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:01:55,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-09 10:01:55,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:55,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083512384] [2024-11-09 10:01:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:55,972 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-09 10:01:55,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083512384] [2024-11-09 10:01:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083512384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:01:55,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:01:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:01:55,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15379903] [2024-11-09 10:01:55,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:01:55,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:01:55,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:55,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:01:55,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:01:55,976 INFO L87 Difference]: Start difference. First operand 2050 states and 3214 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:01:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:57,571 INFO L93 Difference]: Finished difference Result 3814 states and 6130 transitions. [2024-11-09 10:01:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:01:57,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 10:01:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:57,595 INFO L225 Difference]: With dead ends: 3814 [2024-11-09 10:01:57,596 INFO L226 Difference]: Without dead ends: 3814 [2024-11-09 10:01:57,598 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-09 10:01:57,599 INFO L432 NwaCegarLoop]: 2929 mSDtfsCounter, 1908 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 5209 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:57,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 5209 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:01:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2024-11-09 10:01:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3550. [2024-11-09 10:01:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3550 states, 2139 states have (on average 1.9205236091631603) internal successors, (4108), 3541 states have internal predecessors, (4108), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-09 10:01:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 6120 transitions. [2024-11-09 10:01:58,022 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 6120 transitions. Word has length 3 [2024-11-09 10:01:58,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:58,023 INFO L471 AbstractCegarLoop]: Abstraction has 3550 states and 6120 transitions. [2024-11-09 10:01:58,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:01:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 6120 transitions. [2024-11-09 10:01:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:01:58,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:58,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:01:58,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:01:58,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:01:58,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-09 10:01:58,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:58,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444863551] [2024-11-09 10:01:58,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:58,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:58,169 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-09 10:01:58,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:58,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444863551] [2024-11-09 10:01:58,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444863551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:01:58,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:01:58,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:01:58,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340277993] [2024-11-09 10:01:58,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:01:58,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:01:58,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:58,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:01:58,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:01:58,172 INFO L87 Difference]: Start difference. First operand 3550 states and 6120 transitions. Second operand has 3 states, 2 states have (on average 4.0) 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-09 10:01:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:59,498 INFO L93 Difference]: Finished difference Result 6220 states and 11072 transitions. [2024-11-09 10:01:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:01:59,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:01:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:59,538 INFO L225 Difference]: With dead ends: 6220 [2024-11-09 10:01:59,538 INFO L226 Difference]: Without dead ends: 6220 [2024-11-09 10:01:59,539 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-09 10:01:59,540 INFO L432 NwaCegarLoop]: 5189 mSDtfsCounter, 1816 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 7679 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:59,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 7679 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:01:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6220 states. [2024-11-09 10:02:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6220 to 3618. [2024-11-09 10:02:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3618 states, 2217 states have (on average 1.9174560216508796) internal successors, (4251), 3609 states have internal predecessors, (4251), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-09 10:02:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 6263 transitions. [2024-11-09 10:02:00,436 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 6263 transitions. Word has length 8 [2024-11-09 10:02:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:00,436 INFO L471 AbstractCegarLoop]: Abstraction has 3618 states and 6263 transitions. [2024-11-09 10:02:00,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:02:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 6263 transitions. [2024-11-09 10:02:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:02:00,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:00,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:00,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:02:00,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:00,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:00,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-09 10:02:00,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:00,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868081927] [2024-11-09 10:02:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:00,525 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-09 10:02:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868081927] [2024-11-09 10:02:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868081927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:00,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:02:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970579933] [2024-11-09 10:02:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:00,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:00,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:00,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:00,529 INFO L87 Difference]: Start difference. First operand 3618 states and 6263 transitions. Second operand has 3 states, 2 states have (on average 4.0) 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-09 10:02:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:01,691 INFO L93 Difference]: Finished difference Result 4881 states and 8573 transitions. [2024-11-09 10:02:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:01,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:02:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:01,718 INFO L225 Difference]: With dead ends: 4881 [2024-11-09 10:02:01,719 INFO L226 Difference]: Without dead ends: 4881 [2024-11-09 10:02:01,719 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-09 10:02:01,723 INFO L432 NwaCegarLoop]: 5027 mSDtfsCounter, 2076 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 7332 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:01,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 7332 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:02:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2024-11-09 10:02:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 3571. [2024-11-09 10:02:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 2217 states have (on average 1.8822733423545333) internal successors, (4173), 3562 states have internal predecessors, (4173), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-09 10:02:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 6185 transitions. [2024-11-09 10:02:02,132 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 6185 transitions. Word has length 8 [2024-11-09 10:02:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:02,132 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 6185 transitions. [2024-11-09 10:02:02,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:02:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 6185 transitions. [2024-11-09 10:02:02,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 10:02:02,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:02,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:02,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:02:02,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:02,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:02,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1321452160, now seen corresponding path program 1 times [2024-11-09 10:02:02,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:02,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823214433] [2024-11-09 10:02:02,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:02,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:02,219 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-09 10:02:02,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:02,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823214433] [2024-11-09 10:02:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823214433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:02,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:02,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980327789] [2024-11-09 10:02:02,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:02,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:02,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:02,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:02,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:02,224 INFO L87 Difference]: Start difference. First operand 3571 states and 6185 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:03,041 INFO L93 Difference]: Finished difference Result 6790 states and 11777 transitions. [2024-11-09 10:02:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:03,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 10:02:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:03,093 INFO L225 Difference]: With dead ends: 6790 [2024-11-09 10:02:03,094 INFO L226 Difference]: Without dead ends: 6790 [2024-11-09 10:02:03,094 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-09 10:02:03,095 INFO L432 NwaCegarLoop]: 3407 mSDtfsCounter, 2105 mSDsluCounter, 5997 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2608 SdHoareTripleChecker+Valid, 9404 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:03,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2608 Valid, 9404 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:02:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2024-11-09 10:02:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 3573. [2024-11-09 10:02:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3573 states, 2219 states have (on average 1.8814781433077963) internal successors, (4175), 3564 states have internal predecessors, (4175), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-09 10:02:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 6187 transitions. [2024-11-09 10:02:03,654 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 6187 transitions. Word has length 10 [2024-11-09 10:02:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:03,655 INFO L471 AbstractCegarLoop]: Abstraction has 3573 states and 6187 transitions. [2024-11-09 10:02:03,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 6187 transitions. [2024-11-09 10:02:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 10:02:03,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:03,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:03,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:02:03,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:03,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:03,658 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-09 10:02:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:03,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454918381] [2024-11-09 10:02:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:03,720 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-09 10:02:03,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:03,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454918381] [2024-11-09 10:02:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454918381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:03,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:03,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168397730] [2024-11-09 10:02:03,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:03,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:03,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:03,723 INFO L87 Difference]: Start difference. First operand 3573 states and 6187 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-09 10:02:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:06,043 INFO L93 Difference]: Finished difference Result 3648 states and 6293 transitions. [2024-11-09 10:02:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:06,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 10:02:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:06,065 INFO L225 Difference]: With dead ends: 3648 [2024-11-09 10:02:06,066 INFO L226 Difference]: Without dead ends: 3648 [2024-11-09 10:02:06,067 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-09 10:02:06,068 INFO L432 NwaCegarLoop]: 2728 mSDtfsCounter, 2341 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 2340 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2844 SdHoareTripleChecker+Valid, 4328 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:06,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2844 Valid, 4328 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2340 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:02:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2024-11-09 10:02:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3550. [2024-11-09 10:02:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3550 states, 2219 states have (on average 1.8607480847228481) internal successors, (4129), 3541 states have internal predecessors, (4129), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-09 10:02:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 6141 transitions. [2024-11-09 10:02:06,369 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 6141 transitions. Word has length 18 [2024-11-09 10:02:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:06,369 INFO L471 AbstractCegarLoop]: Abstraction has 3550 states and 6141 transitions. [2024-11-09 10:02:06,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-09 10:02:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 6141 transitions. [2024-11-09 10:02:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 10:02:06,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:06,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:06,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:02:06,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:06,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash 183846335, now seen corresponding path program 1 times [2024-11-09 10:02:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098661524] [2024-11-09 10:02:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:06,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:06,453 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-09 10:02:06,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:06,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098661524] [2024-11-09 10:02:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098661524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:06,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637911714] [2024-11-09 10:02:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:06,455 INFO L87 Difference]: Start difference. First operand 3550 states and 6141 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-09 10:02:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:06,499 INFO L93 Difference]: Finished difference Result 3412 states and 5935 transitions. [2024-11-09 10:02:06,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:06,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 10:02:06,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:06,509 INFO L225 Difference]: With dead ends: 3412 [2024-11-09 10:02:06,509 INFO L226 Difference]: Without dead ends: 3412 [2024-11-09 10:02:06,509 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-09 10:02:06,510 INFO L432 NwaCegarLoop]: 3009 mSDtfsCounter, 61 mSDsluCounter, 2956 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5965 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:06,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5965 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2024-11-09 10:02:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3412. [2024-11-09 10:02:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3412 states, 2093 states have (on average 1.8743430482560917) internal successors, (3923), 3403 states have internal predecessors, (3923), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-09 10:02:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 5935 transitions. [2024-11-09 10:02:06,721 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 5935 transitions. Word has length 18 [2024-11-09 10:02:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:06,721 INFO L471 AbstractCegarLoop]: Abstraction has 3412 states and 5935 transitions. [2024-11-09 10:02:06,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-09 10:02:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 5935 transitions. [2024-11-09 10:02:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 10:02:06,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:06,722 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] [2024-11-09 10:02:06,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:02:06,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:06,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash 582825947, now seen corresponding path program 1 times [2024-11-09 10:02:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:06,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543168089] [2024-11-09 10:02:06,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:06,794 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-09 10:02:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:06,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543168089] [2024-11-09 10:02:06,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543168089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:06,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:06,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415484750] [2024-11-09 10:02:06,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:06,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:06,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:06,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:06,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:06,797 INFO L87 Difference]: Start difference. First operand 3412 states and 5935 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-09 10:02:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:06,877 INFO L93 Difference]: Finished difference Result 3383 states and 5885 transitions. [2024-11-09 10:02:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:06,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-09 10:02:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:06,888 INFO L225 Difference]: With dead ends: 3383 [2024-11-09 10:02:06,888 INFO L226 Difference]: Without dead ends: 3383 [2024-11-09 10:02:06,888 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-09 10:02:06,889 INFO L432 NwaCegarLoop]: 2974 mSDtfsCounter, 41 mSDsluCounter, 5920 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8894 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:06,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8894 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2024-11-09 10:02:07,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3377. [2024-11-09 10:02:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3377 states, 2065 states have (on average 1.872639225181598) internal successors, (3867), 3368 states have internal predecessors, (3867), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-09 10:02:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 5879 transitions. [2024-11-09 10:02:07,141 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 5879 transitions. Word has length 20 [2024-11-09 10:02:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:07,142 INFO L471 AbstractCegarLoop]: Abstraction has 3377 states and 5879 transitions. [2024-11-09 10:02:07,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-09 10:02:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 5879 transitions. [2024-11-09 10:02:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 10:02:07,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:07,146 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] [2024-11-09 10:02:07,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:02:07,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:07,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1292750889, now seen corresponding path program 1 times [2024-11-09 10:02:07,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:07,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571295080] [2024-11-09 10:02:07,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:07,312 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-09 10:02:07,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:07,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571295080] [2024-11-09 10:02:07,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571295080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:07,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:07,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:07,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908963991] [2024-11-09 10:02:07,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:07,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:07,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:07,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:07,314 INFO L87 Difference]: Start difference. First operand 3377 states and 5879 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-09 10:02:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:09,730 INFO L93 Difference]: Finished difference Result 6073 states and 10832 transitions. [2024-11-09 10:02:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:09,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 10:02:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:09,752 INFO L225 Difference]: With dead ends: 6073 [2024-11-09 10:02:09,753 INFO L226 Difference]: Without dead ends: 6073 [2024-11-09 10:02:09,753 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-09 10:02:09,755 INFO L432 NwaCegarLoop]: 2812 mSDtfsCounter, 1817 mSDsluCounter, 3579 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2317 SdHoareTripleChecker+Valid, 6391 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:09,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2317 Valid, 6391 Invalid, 2392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 10:02:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2024-11-09 10:02:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3373. [2024-11-09 10:02:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3373 states, 2065 states have (on average 1.8687651331719128) internal successors, (3859), 3364 states have internal predecessors, (3859), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-09 10:02:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 5871 transitions. [2024-11-09 10:02:10,214 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 5871 transitions. Word has length 34 [2024-11-09 10:02:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:10,215 INFO L471 AbstractCegarLoop]: Abstraction has 3373 states and 5871 transitions. [2024-11-09 10:02:10,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-09 10:02:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 5871 transitions. [2024-11-09 10:02:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 10:02:10,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:10,217 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-09 10:02:10,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:02:10,217 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:10,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash 808848765, now seen corresponding path program 1 times [2024-11-09 10:02:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:10,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493579004] [2024-11-09 10:02:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:10,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:10,348 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-09 10:02:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:10,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493579004] [2024-11-09 10:02:10,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493579004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:10,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:10,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756875500] [2024-11-09 10:02:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:10,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:10,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:10,352 INFO L87 Difference]: Start difference. First operand 3373 states and 5871 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-09 10:02:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:10,424 INFO L93 Difference]: Finished difference Result 3373 states and 5863 transitions. [2024-11-09 10:02:10,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:02:10,424 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-09 10:02:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:10,436 INFO L225 Difference]: With dead ends: 3373 [2024-11-09 10:02:10,437 INFO L226 Difference]: Without dead ends: 3373 [2024-11-09 10:02:10,437 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-09 10:02:10,437 INFO L432 NwaCegarLoop]: 2969 mSDtfsCounter, 21 mSDsluCounter, 5907 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8876 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:10,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8876 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2024-11-09 10:02:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3373. [2024-11-09 10:02:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3373 states, 2065 states have (on average 1.8648910411622277) internal successors, (3851), 3364 states have internal predecessors, (3851), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-09 10:02:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 5863 transitions. [2024-11-09 10:02:10,690 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 5863 transitions. Word has length 68 [2024-11-09 10:02:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:10,691 INFO L471 AbstractCegarLoop]: Abstraction has 3373 states and 5863 transitions. [2024-11-09 10:02:10,691 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-09 10:02:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 5863 transitions. [2024-11-09 10:02:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 10:02:10,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:10,692 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-09 10:02:10,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:02:10,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:10,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash -324916151, now seen corresponding path program 1 times [2024-11-09 10:02:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:10,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267434830] [2024-11-09 10:02:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:10,846 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-09 10:02:10,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:10,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267434830] [2024-11-09 10:02:10,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267434830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:10,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:10,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:10,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648954100] [2024-11-09 10:02:10,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:10,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:10,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:10,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:10,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:10,850 INFO L87 Difference]: Start difference. First operand 3373 states and 5863 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-09 10:02:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:10,944 INFO L93 Difference]: Finished difference Result 5883 states and 10585 transitions. [2024-11-09 10:02:10,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:10,945 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-09 10:02:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:10,962 INFO L225 Difference]: With dead ends: 5883 [2024-11-09 10:02:10,962 INFO L226 Difference]: Without dead ends: 5883 [2024-11-09 10:02:10,963 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-09 10:02:10,963 INFO L432 NwaCegarLoop]: 3283 mSDtfsCounter, 1354 mSDsluCounter, 2939 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 6222 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:10,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 6222 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2024-11-09 10:02:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 5826. [2024-11-09 10:02:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5826 states, 3518 states have (on average 1.8675383740761797) internal successors, (6570), 5817 states have internal predecessors, (6570), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-09 10:02:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 10582 transitions. [2024-11-09 10:02:11,308 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 10582 transitions. Word has length 76 [2024-11-09 10:02:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:11,309 INFO L471 AbstractCegarLoop]: Abstraction has 5826 states and 10582 transitions. [2024-11-09 10:02:11,309 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-09 10:02:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 10582 transitions. [2024-11-09 10:02:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 10:02:11,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:11,310 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-09 10:02:11,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:02:11,311 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:11,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1172114397, now seen corresponding path program 1 times [2024-11-09 10:02:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:11,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784888172] [2024-11-09 10:02:11,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:11,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:11,784 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-09 10:02:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784888172] [2024-11-09 10:02:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784888172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:11,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:02:11,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152528718] [2024-11-09 10:02:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:02:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:02:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:02:11,787 INFO L87 Difference]: Start difference. First operand 5826 states and 10582 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-09 10:02:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:14,030 INFO L93 Difference]: Finished difference Result 5788 states and 10530 transitions. [2024-11-09 10:02:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:02:14,030 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-09 10:02:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:14,046 INFO L225 Difference]: With dead ends: 5788 [2024-11-09 10:02:14,046 INFO L226 Difference]: Without dead ends: 5788 [2024-11-09 10:02:14,046 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-09 10:02:14,047 INFO L432 NwaCegarLoop]: 2492 mSDtfsCounter, 3737 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4240 SdHoareTripleChecker+Valid, 3944 SdHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:14,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4240 Valid, 3944 Invalid, 2475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:02:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2024-11-09 10:02:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5710. [2024-11-09 10:02:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5710 states, 3440 states have (on average 1.8494186046511627) internal successors, (6362), 5701 states have internal predecessors, (6362), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-09 10:02:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5710 states to 5710 states and 10374 transitions. [2024-11-09 10:02:14,518 INFO L78 Accepts]: Start accepts. Automaton has 5710 states and 10374 transitions. Word has length 79 [2024-11-09 10:02:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:14,519 INFO L471 AbstractCegarLoop]: Abstraction has 5710 states and 10374 transitions. [2024-11-09 10:02:14,520 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-09 10:02:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 10374 transitions. [2024-11-09 10:02:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 10:02:14,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:14,521 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-09 10:02:14,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:02:14,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:14,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1012783132, now seen corresponding path program 1 times [2024-11-09 10:02:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:14,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835136696] [2024-11-09 10:02:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:14,812 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-09 10:02:14,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:14,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835136696] [2024-11-09 10:02:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835136696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:14,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469909140] [2024-11-09 10:02:14,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:14,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:02:14,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:14,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:02:14,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:14,816 INFO L87 Difference]: Start difference. First operand 5710 states and 10374 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-09 10:02:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:15,471 INFO L93 Difference]: Finished difference Result 5709 states and 10372 transitions. [2024-11-09 10:02:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:02:15,472 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-09 10:02:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:15,489 INFO L225 Difference]: With dead ends: 5709 [2024-11-09 10:02:15,489 INFO L226 Difference]: Without dead ends: 5709 [2024-11-09 10:02:15,490 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-09 10:02:15,490 INFO L432 NwaCegarLoop]: 2942 mSDtfsCounter, 2 mSDsluCounter, 7858 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10800 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:15,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10800 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:02:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2024-11-09 10:02:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 5709. [2024-11-09 10:02:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5709 states, 3440 states have (on average 1.8488372093023255) internal successors, (6360), 5700 states have internal predecessors, (6360), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-09 10:02:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 10372 transitions. [2024-11-09 10:02:16,086 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 10372 transitions. Word has length 84 [2024-11-09 10:02:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:16,086 INFO L471 AbstractCegarLoop]: Abstraction has 5709 states and 10372 transitions. [2024-11-09 10:02:16,086 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-09 10:02:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 10372 transitions. [2024-11-09 10:02:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 10:02:16,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:16,087 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-09 10:02:16,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:02:16,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:16,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1012783133, now seen corresponding path program 1 times [2024-11-09 10:02:16,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:16,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322976484] [2024-11-09 10:02:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:16,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:16,529 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-09 10:02:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:16,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322976484] [2024-11-09 10:02:16,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322976484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:16,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:16,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926312961] [2024-11-09 10:02:16,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:16,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:02:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:16,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:02:16,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:16,532 INFO L87 Difference]: Start difference. First operand 5709 states and 10372 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-09 10:02:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:17,304 INFO L93 Difference]: Finished difference Result 5708 states and 10370 transitions. [2024-11-09 10:02:17,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:02:17,304 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-09 10:02:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:17,320 INFO L225 Difference]: With dead ends: 5708 [2024-11-09 10:02:17,320 INFO L226 Difference]: Without dead ends: 5708 [2024-11-09 10:02:17,321 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-09 10:02:17,322 INFO L432 NwaCegarLoop]: 2942 mSDtfsCounter, 1 mSDsluCounter, 7842 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10784 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:17,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10784 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:02:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5708 states. [2024-11-09 10:02:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5708 to 5708. [2024-11-09 10:02:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5708 states, 3438 states have (on average 1.8493310063990693) internal successors, (6358), 5699 states have internal predecessors, (6358), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-09 10:02:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 10370 transitions. [2024-11-09 10:02:17,780 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 10370 transitions. Word has length 84 [2024-11-09 10:02:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:17,781 INFO L471 AbstractCegarLoop]: Abstraction has 5708 states and 10370 transitions. [2024-11-09 10:02:17,781 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-09 10:02:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 10370 transitions. [2024-11-09 10:02:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:02:17,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:17,785 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-09 10:02:17,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:02:17,785 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:17,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1534467971, now seen corresponding path program 1 times [2024-11-09 10:02:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:17,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672553531] [2024-11-09 10:02:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:17,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:18,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:02:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:18,030 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-09 10:02:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672553531] [2024-11-09 10:02:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672553531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:18,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:18,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:02:18,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729663959] [2024-11-09 10:02:18,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:18,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:02:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:18,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:02:18,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:02:18,033 INFO L87 Difference]: Start difference. First operand 5708 states and 10370 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-09 10:02:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:22,115 INFO L93 Difference]: Finished difference Result 5726 states and 10396 transitions. [2024-11-09 10:02:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:02:22,116 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-09 10:02:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:22,131 INFO L225 Difference]: With dead ends: 5726 [2024-11-09 10:02:22,131 INFO L226 Difference]: Without dead ends: 5726 [2024-11-09 10:02:22,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:02:22,132 INFO L432 NwaCegarLoop]: 2927 mSDtfsCounter, 17 mSDsluCounter, 9915 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12842 SdHoareTripleChecker+Invalid, 4817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:22,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12842 Invalid, 4817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 10:02:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2024-11-09 10:02:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5717. [2024-11-09 10:02:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5717 states, 3446 states have (on average 1.8482298316889147) internal successors, (6369), 5706 states have internal predecessors, (6369), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2024-11-09 10:02:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5717 states to 5717 states and 10386 transitions. [2024-11-09 10:02:22,529 INFO L78 Accepts]: Start accepts. Automaton has 5717 states and 10386 transitions. Word has length 92 [2024-11-09 10:02:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:22,529 INFO L471 AbstractCegarLoop]: Abstraction has 5717 states and 10386 transitions. [2024-11-09 10:02:22,529 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-09 10:02:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5717 states and 10386 transitions. [2024-11-09 10:02:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:02:22,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:22,530 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-09 10:02:22,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:02:22,531 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:22,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1534467972, now seen corresponding path program 1 times [2024-11-09 10:02:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:22,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500759381] [2024-11-09 10:02:22,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:22,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:02:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:23,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:23,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500759381] [2024-11-09 10:02:23,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500759381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:23,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:23,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:02:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124831221] [2024-11-09 10:02:23,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:23,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:02:23,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:02:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:02:23,042 INFO L87 Difference]: Start difference. First operand 5717 states and 10386 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-09 10:02:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:26,668 INFO L93 Difference]: Finished difference Result 5717 states and 10384 transitions. [2024-11-09 10:02:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:02:26,668 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-09 10:02:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:26,689 INFO L225 Difference]: With dead ends: 5717 [2024-11-09 10:02:26,689 INFO L226 Difference]: Without dead ends: 5717 [2024-11-09 10:02:26,690 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-09 10:02:26,690 INFO L432 NwaCegarLoop]: 2931 mSDtfsCounter, 18 mSDsluCounter, 8135 mSDsCounter, 0 mSdLazyCounter, 3140 mSolverCounterSat, 1007 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 11066 SdHoareTripleChecker+Invalid, 4147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1007 IncrementalHoareTripleChecker+Valid, 3140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:26,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 11066 Invalid, 4147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1007 Valid, 3140 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 10:02:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5717 states. [2024-11-09 10:02:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5717 to 5717. [2024-11-09 10:02:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5717 states, 3446 states have (on average 1.8476494486361) internal successors, (6367), 5706 states have internal predecessors, (6367), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2024-11-09 10:02:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5717 states to 5717 states and 10384 transitions. [2024-11-09 10:02:27,152 INFO L78 Accepts]: Start accepts. Automaton has 5717 states and 10384 transitions. Word has length 92 [2024-11-09 10:02:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:27,153 INFO L471 AbstractCegarLoop]: Abstraction has 5717 states and 10384 transitions. [2024-11-09 10:02:27,154 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-09 10:02:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 5717 states and 10384 transitions. [2024-11-09 10:02:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:02:27,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:27,156 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-09 10:02:27,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:02:27,156 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:27,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1739310447, now seen corresponding path program 1 times [2024-11-09 10:02:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:27,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049712560] [2024-11-09 10:02:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:27,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:02:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:27,786 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-09 10:02:27,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049712560] [2024-11-09 10:02:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049712560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414677615] [2024-11-09 10:02:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:27,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:02:27,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:02:27,790 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-09 10:02:27,792 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-09 10:02:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:28,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 10:02:28,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:28,204 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:02:28,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 10:02:28,249 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-09 10:02:28,341 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-09 10:02:28,527 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:28,527 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-09 10:02:28,575 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-09 10:02:28,609 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-09 10:02:28,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:28,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_645) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 10:02:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414677615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:28,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:28,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-09 10:02:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034908285] [2024-11-09 10:02:28,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:02:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:28,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:02:28,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-09 10:02:28,650 INFO L87 Difference]: Start difference. First operand 5717 states and 10384 transitions. Second operand has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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-09 10:02:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:39,482 INFO L93 Difference]: Finished difference Result 5724 states and 10390 transitions. [2024-11-09 10:02:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:02:39,482 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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-09 10:02:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:39,497 INFO L225 Difference]: With dead ends: 5724 [2024-11-09 10:02:39,498 INFO L226 Difference]: Without dead ends: 5724 [2024-11-09 10:02:39,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2024-11-09 10:02:39,500 INFO L432 NwaCegarLoop]: 2616 mSDtfsCounter, 1891 mSDsluCounter, 21246 mSDsCounter, 0 mSdLazyCounter, 14384 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 23862 SdHoareTripleChecker+Invalid, 14900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 14384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:39,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 23862 Invalid, 14900 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [516 Valid, 14384 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-11-09 10:02:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2024-11-09 10:02:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5721. [2024-11-09 10:02:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5721 states, 3450 states have (on average 1.846376811594203) internal successors, (6370), 5709 states have internal predecessors, (6370), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-09 10:02:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5721 states to 5721 states and 10384 transitions. [2024-11-09 10:02:40,006 INFO L78 Accepts]: Start accepts. Automaton has 5721 states and 10384 transitions. Word has length 93 [2024-11-09 10:02:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:40,007 INFO L471 AbstractCegarLoop]: Abstraction has 5721 states and 10384 transitions. [2024-11-09 10:02:40,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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-09 10:02:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5721 states and 10384 transitions. [2024-11-09 10:02:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:02:40,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:40,008 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-09 10:02:40,030 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-09 10:02:40,209 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,SelfDestructingSolverStorable16 [2024-11-09 10:02:40,210 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:40,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1739310446, now seen corresponding path program 1 times [2024-11-09 10:02:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761105481] [2024-11-09 10:02:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:02:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:41,141 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-09 10:02:41,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:41,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761105481] [2024-11-09 10:02:41,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761105481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:41,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815314673] [2024-11-09 10:02:41,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:41,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:02:41,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:02:41,145 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-09 10:02:41,146 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-09 10:02:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:41,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 10:02:41,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:41,482 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:02:41,483 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-09 10:02:41,489 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-09 10:02:41,509 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-09 10:02:41,513 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-09 10:02:41,578 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-09 10:02:41,584 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-09 10:02:41,690 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:41,690 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-09 10:02:41,700 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-09 10:02:41,727 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-09 10:02:41,735 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-09 10:02:41,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-09 10:02:41,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:41,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_795 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-09 10:02:41,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815314673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:41,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:41,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-09 10:02:41,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091138104] [2024-11-09 10:02:41,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:41,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:02:41,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:41,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:02:41,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-09 10:02:41,842 INFO L87 Difference]: Start difference. First operand 5721 states and 10384 transitions. Second operand has 16 states, 13 states have (on average 8.615384615384615) internal successors, (112), 15 states have internal predecessors, (112), 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-09 10:02:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:47,346 INFO L93 Difference]: Finished difference Result 5723 states and 10388 transitions. [2024-11-09 10:02:47,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:02:47,347 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.615384615384615) internal successors, (112), 15 states have internal predecessors, (112), 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-09 10:02:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:47,358 INFO L225 Difference]: With dead ends: 5723 [2024-11-09 10:02:47,358 INFO L226 Difference]: Without dead ends: 5723 [2024-11-09 10:02:47,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=420, Unknown=1, NotChecked=42, Total=552 [2024-11-09 10:02:47,359 INFO L432 NwaCegarLoop]: 2619 mSDtfsCounter, 1896 mSDsluCounter, 12815 mSDsCounter, 0 mSdLazyCounter, 8592 mSolverCounterSat, 1020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2400 SdHoareTripleChecker+Valid, 15434 SdHoareTripleChecker+Invalid, 9612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1020 IncrementalHoareTripleChecker+Valid, 8592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:47,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2400 Valid, 15434 Invalid, 9612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1020 Valid, 8592 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-09 10:02:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5723 states. [2024-11-09 10:02:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5723 to 5711. [2024-11-09 10:02:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5711 states, 3442 states have (on average 1.847472399767577) internal successors, (6359), 5701 states have internal predecessors, (6359), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-09 10:02:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5711 states to 5711 states and 10371 transitions. [2024-11-09 10:02:47,780 INFO L78 Accepts]: Start accepts. Automaton has 5711 states and 10371 transitions. Word has length 93 [2024-11-09 10:02:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:47,781 INFO L471 AbstractCegarLoop]: Abstraction has 5711 states and 10371 transitions. [2024-11-09 10:02:47,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.615384615384615) internal successors, (112), 15 states have internal predecessors, (112), 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-09 10:02:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 5711 states and 10371 transitions. [2024-11-09 10:02:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:02:47,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:47,782 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-09 10:02:47,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:02:47,986 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,SelfDestructingSolverStorable17 [2024-11-09 10:02:47,987 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:47,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:47,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1999032260, now seen corresponding path program 1 times [2024-11-09 10:02:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:47,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224558096] [2024-11-09 10:02:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:48,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:02:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:48,488 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-09 10:02:48,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:48,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224558096] [2024-11-09 10:02:48,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224558096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:48,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:48,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:02:48,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741693437] [2024-11-09 10:02:48,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:48,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:02:48,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:48,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:02:48,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:02:48,491 INFO L87 Difference]: Start difference. First operand 5711 states and 10371 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-09 10:02:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:55,020 INFO L93 Difference]: Finished difference Result 5730 states and 10396 transitions. [2024-11-09 10:02:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:02:55,020 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-09 10:02:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:55,035 INFO L225 Difference]: With dead ends: 5730 [2024-11-09 10:02:55,035 INFO L226 Difference]: Without dead ends: 5730 [2024-11-09 10:02:55,035 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-09 10:02:55,036 INFO L432 NwaCegarLoop]: 2616 mSDtfsCounter, 1909 mSDsluCounter, 14837 mSDsCounter, 0 mSdLazyCounter, 9030 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 17453 SdHoareTripleChecker+Invalid, 9543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 9030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:55,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 17453 Invalid, 9543 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [513 Valid, 9030 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-09 10:02:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2024-11-09 10:02:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5726. [2024-11-09 10:02:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5726 states, 3456 states have (on average 1.8449074074074074) internal successors, (6376), 5714 states have internal predecessors, (6376), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-09 10:02:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5726 states to 5726 states and 10390 transitions. [2024-11-09 10:02:55,602 INFO L78 Accepts]: Start accepts. Automaton has 5726 states and 10390 transitions. Word has length 95 [2024-11-09 10:02:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:55,603 INFO L471 AbstractCegarLoop]: Abstraction has 5726 states and 10390 transitions. [2024-11-09 10:02:55,603 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-09 10:02:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 5726 states and 10390 transitions. [2024-11-09 10:02:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:02:55,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:55,604 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-09 10:02:55,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:02:55,604 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:02:55,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1999032261, now seen corresponding path program 1 times [2024-11-09 10:02:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877004898] [2024-11-09 10:02:55,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:02:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:56,397 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-09 10:02:56,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:56,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877004898] [2024-11-09 10:02:56,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877004898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:56,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:56,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:02:56,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74980773] [2024-11-09 10:02:56,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:56,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:02:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:56,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:02:56,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:02:56,399 INFO L87 Difference]: Start difference. First operand 5726 states and 10390 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)