./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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 e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:59:29,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:59:29,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:59:29,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:59:29,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:59:29,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:59:29,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:59:29,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:59:29,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:59:29,341 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:59:29,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:59:29,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:59:29,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:59:29,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:59:29,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:59:29,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:59:29,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:59:29,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:59:29,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:59:29,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:59:29,345 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:59:29,350 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:59:29,350 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:59:29,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:59:29,351 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:59:29,351 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:59:29,351 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:59:29,351 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:59:29,352 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:59:29,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:59:29,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:59:29,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:59:29,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:59:29,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:59:29,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:59:29,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:59:29,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:59:29,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:59:29,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:59:29,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:59:29,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:59:29,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:59:29,358 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 -> e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 [2024-11-17 02:59:29,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:59:29,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:59:29,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:59:29,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:59:29,655 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:59:29,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2024-11-17 02:59:31,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:59:31,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:59:31,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2024-11-17 02:59:31,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5db4262/408819bc069b491cb7274988336dbeaf/FLAGe0f6dbe51 [2024-11-17 02:59:31,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5db4262/408819bc069b491cb7274988336dbeaf [2024-11-17 02:59:31,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:59:31,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:59:31,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:59:31,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:59:31,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:59:31,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:59:31" (1/1) ... [2024-11-17 02:59:31,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170ec0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:31, skipping insertion in model container [2024-11-17 02:59:31,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:59:31" (1/1) ... [2024-11-17 02:59:31,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:59:32,420 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:59:32,444 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:59:32,450 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:59:32,459 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:59:32,469 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:59:32,493 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:59:32,494 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:59:32,496 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:59:32,496 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:59:32,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:59:32,515 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:59:32,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:59:32,714 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:59:32,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32 WrapperNode [2024-11-17 02:59:32,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:59:32,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:59:32,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:59:32,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:59:32,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:32,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:32,898 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3262 [2024-11-17 02:59:32,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:59:32,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:59:32,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:59:32,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:59:32,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:32,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:32,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:33,100 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 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, 42, 4]. [2024-11-17 02:59:33,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:33,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:33,182 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:33,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:33,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:33,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:33,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:59:33,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:59:33,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:59:33,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:59:33,230 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (1/1) ... [2024-11-17 02:59:33,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:59:33,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:59:33,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 02:59:33,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 02:59:33,339 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 02:59:33,341 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 02:59:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 02:59:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 02:59:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 02:59:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 02:59:33,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 02:59:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 02:59:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 02:59:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 02:59:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:59:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:59:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 02:59:33,344 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:59:33,344 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:59:33,344 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 02:59:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:59:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:59:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:59:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:59:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 02:59:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 02:59:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:59:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:59:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 02:59:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:59:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 02:59:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 02:59:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 02:59:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:59:33,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:59:33,571 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:59:33,574 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:59:36,854 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 02:59:37,188 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2024-11-17 02:59:37,189 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:59:37,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:59:37,296 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 02:59:37,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:59:37 BoogieIcfgContainer [2024-11-17 02:59:37,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:59:37,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:59:37,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:59:37,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:59:37,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:59:31" (1/3) ... [2024-11-17 02:59:37,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7300d9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:59:37, skipping insertion in model container [2024-11-17 02:59:37,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:59:32" (2/3) ... [2024-11-17 02:59:37,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7300d9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:59:37, skipping insertion in model container [2024-11-17 02:59:37,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:59:37" (3/3) ... [2024-11-17 02:59:37,310 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-1.i [2024-11-17 02:59:37,327 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:59:37,329 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-11-17 02:59:37,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:59:37,442 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;@561f0d9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:59:37,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-17 02:59:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 2086 states, 1156 states have (on average 1.9896193771626298) internal successors, (2300), 2079 states have internal predecessors, (2300), 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-17 02:59:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:59:37,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:37,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:59:37,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:37,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:37,467 INFO L85 PathProgramCache]: Analyzing trace with hash 4350300, now seen corresponding path program 1 times [2024-11-17 02:59:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:37,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44670708] [2024-11-17 02:59:37,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:37,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:37,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44670708] [2024-11-17 02:59:37,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44670708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:37,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:59:37,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944915424] [2024-11-17 02:59:37,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:37,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:37,760 INFO L87 Difference]: Start difference. First operand has 2086 states, 1156 states have (on average 1.9896193771626298) internal successors, (2300), 2079 states have internal predecessors, (2300), 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-17 02:59:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:39,292 INFO L93 Difference]: Finished difference Result 2071 states and 3235 transitions. [2024-11-17 02:59:39,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:39,295 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-17 02:59:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:39,332 INFO L225 Difference]: With dead ends: 2071 [2024-11-17 02:59:39,332 INFO L226 Difference]: Without dead ends: 2068 [2024-11-17 02:59:39,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:39,337 INFO L432 NwaCegarLoop]: 2804 mSDtfsCounter, 2108 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 2857 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:39,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2611 Valid, 2857 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 02:59:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2024-11-17 02:59:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2068. [2024-11-17 02:59:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1156 states have (on average 1.9238754325259515) internal successors, (2224), 2061 states have internal predecessors, (2224), 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-17 02:59:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 3232 transitions. [2024-11-17 02:59:39,693 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 3232 transitions. Word has length 3 [2024-11-17 02:59:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:39,694 INFO L471 AbstractCegarLoop]: Abstraction has 2068 states and 3232 transitions. [2024-11-17 02:59:39,694 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-17 02:59:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 3232 transitions. [2024-11-17 02:59:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:59:39,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:39,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:59:39,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 02:59:39,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:39,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash 4350301, now seen corresponding path program 1 times [2024-11-17 02:59:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:39,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031197557] [2024-11-17 02:59:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:39,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:39,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031197557] [2024-11-17 02:59:39,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031197557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:39,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:39,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:59:39,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169989010] [2024-11-17 02:59:39,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:39,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:39,800 INFO L87 Difference]: Start difference. First operand 2068 states and 3232 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-17 02:59:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:41,412 INFO L93 Difference]: Finished difference Result 3845 states and 6161 transitions. [2024-11-17 02:59:41,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:41,413 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-17 02:59:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:41,431 INFO L225 Difference]: With dead ends: 3845 [2024-11-17 02:59:41,432 INFO L226 Difference]: Without dead ends: 3845 [2024-11-17 02:59:41,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:41,433 INFO L432 NwaCegarLoop]: 2906 mSDtfsCounter, 1921 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 5163 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:41,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2423 Valid, 5163 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:59:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2024-11-17 02:59:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3581. [2024-11-17 02:59:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 2170 states have (on average 1.907373271889401) internal successors, (4139), 3572 states have internal predecessors, (4139), 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-17 02:59:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 6151 transitions. [2024-11-17 02:59:41,759 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 6151 transitions. Word has length 3 [2024-11-17 02:59:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:41,760 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 6151 transitions. [2024-11-17 02:59:41,760 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-17 02:59:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 6151 transitions. [2024-11-17 02:59:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:59:41,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:41,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:41,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 02:59:41,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:41,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1047985906, now seen corresponding path program 1 times [2024-11-17 02:59:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196962366] [2024-11-17 02:59:41,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:41,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:41,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196962366] [2024-11-17 02:59:41,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196962366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:41,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:41,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:59:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552509814] [2024-11-17 02:59:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:41,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:41,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:41,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:41,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:41,888 INFO L87 Difference]: Start difference. First operand 3581 states and 6151 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:43,153 INFO L93 Difference]: Finished difference Result 4852 states and 8476 transitions. [2024-11-17 02:59:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:43,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-17 02:59:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:43,183 INFO L225 Difference]: With dead ends: 4852 [2024-11-17 02:59:43,183 INFO L226 Difference]: Without dead ends: 4852 [2024-11-17 02:59:43,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:43,187 INFO L432 NwaCegarLoop]: 4954 mSDtfsCounter, 2093 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2596 SdHoareTripleChecker+Valid, 7249 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:43,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2596 Valid, 7249 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:59:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4852 states. [2024-11-17 02:59:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4852 to 3534. [2024-11-17 02:59:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3534 states, 2170 states have (on average 1.8746543778801843) internal successors, (4068), 3525 states have internal predecessors, (4068), 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-17 02:59:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 6080 transitions. [2024-11-17 02:59:43,837 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 6080 transitions. Word has length 9 [2024-11-17 02:59:43,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:43,839 INFO L471 AbstractCegarLoop]: Abstraction has 3534 states and 6080 transitions. [2024-11-17 02:59:43,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 6080 transitions. [2024-11-17 02:59:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:59:43,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:43,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:43,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 02:59:43,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:43,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1047985907, now seen corresponding path program 1 times [2024-11-17 02:59:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:43,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462721266] [2024-11-17 02:59:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:43,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462721266] [2024-11-17 02:59:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462721266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:43,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:43,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:59:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150342457] [2024-11-17 02:59:43,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:43,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:43,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:43,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:43,996 INFO L87 Difference]: Start difference. First operand 3534 states and 6080 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:45,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:45,317 INFO L93 Difference]: Finished difference Result 6071 states and 10833 transitions. [2024-11-17 02:59:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:45,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-17 02:59:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:45,355 INFO L225 Difference]: With dead ends: 6071 [2024-11-17 02:59:45,356 INFO L226 Difference]: Without dead ends: 6071 [2024-11-17 02:59:45,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:45,357 INFO L432 NwaCegarLoop]: 5107 mSDtfsCounter, 1882 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 7520 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:45,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 7520 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 02:59:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2024-11-17 02:59:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3509. [2024-11-17 02:59:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 2170 states have (on average 1.852073732718894) internal successors, (4019), 3500 states have internal predecessors, (4019), 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-17 02:59:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 6031 transitions. [2024-11-17 02:59:45,914 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 6031 transitions. Word has length 9 [2024-11-17 02:59:45,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:45,915 INFO L471 AbstractCegarLoop]: Abstraction has 3509 states and 6031 transitions. [2024-11-17 02:59:45,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 6031 transitions. [2024-11-17 02:59:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 02:59:45,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:45,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:45,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 02:59:45,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:45,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1549914626, now seen corresponding path program 1 times [2024-11-17 02:59:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:45,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320326603] [2024-11-17 02:59:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:46,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-17 02:59:46,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:46,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320326603] [2024-11-17 02:59:46,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320326603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:46,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:46,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:46,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699078223] [2024-11-17 02:59:46,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:46,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:46,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:46,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:46,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:46,033 INFO L87 Difference]: Start difference. First operand 3509 states and 6031 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:46,906 INFO L93 Difference]: Finished difference Result 6697 states and 11553 transitions. [2024-11-17 02:59:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:46,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-17 02:59:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:46,980 INFO L225 Difference]: With dead ends: 6697 [2024-11-17 02:59:46,980 INFO L226 Difference]: Without dead ends: 6697 [2024-11-17 02:59:46,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:46,982 INFO L432 NwaCegarLoop]: 3394 mSDtfsCounter, 2106 mSDsluCounter, 5946 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2609 SdHoareTripleChecker+Valid, 9340 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:46,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2609 Valid, 9340 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:59:46,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6697 states. [2024-11-17 02:59:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6697 to 3512. [2024-11-17 02:59:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 2173 states have (on average 1.8508973768982973) internal successors, (4022), 3503 states have internal predecessors, (4022), 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-17 02:59:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 6034 transitions. [2024-11-17 02:59:47,573 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 6034 transitions. Word has length 13 [2024-11-17 02:59:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:47,573 INFO L471 AbstractCegarLoop]: Abstraction has 3512 states and 6034 transitions. [2024-11-17 02:59:47,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 6034 transitions. [2024-11-17 02:59:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 02:59:47,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:47,574 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-17 02:59:47,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 02:59:47,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:47,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:47,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2008439411, now seen corresponding path program 1 times [2024-11-17 02:59:47,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:47,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498500523] [2024-11-17 02:59:47,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:47,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:47,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:47,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498500523] [2024-11-17 02:59:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498500523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:47,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:47,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:59:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611338779] [2024-11-17 02:59:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:47,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:47,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:47,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:47,649 INFO L87 Difference]: Start difference. First operand 3512 states and 6034 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) 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-17 02:59:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:50,196 INFO L93 Difference]: Finished difference Result 3587 states and 6140 transitions. [2024-11-17 02:59:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:50,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) 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-17 02:59:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:50,209 INFO L225 Difference]: With dead ends: 3587 [2024-11-17 02:59:50,210 INFO L226 Difference]: Without dead ends: 3587 [2024-11-17 02:59:50,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:50,211 INFO L432 NwaCegarLoop]: 2705 mSDtfsCounter, 2358 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2861 SdHoareTripleChecker+Valid, 4292 SdHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:50,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2861 Valid, 4292 Invalid, 2398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-17 02:59:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2024-11-17 02:59:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 3489. [2024-11-17 02:59:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3489 states, 2173 states have (on average 1.829728485964105) internal successors, (3976), 3480 states have internal predecessors, (3976), 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-17 02:59:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 5988 transitions. [2024-11-17 02:59:50,490 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 5988 transitions. Word has length 20 [2024-11-17 02:59:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:50,490 INFO L471 AbstractCegarLoop]: Abstraction has 3489 states and 5988 transitions. [2024-11-17 02:59:50,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) 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-17 02:59:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 5988 transitions. [2024-11-17 02:59:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 02:59:50,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:50,492 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-17 02:59:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 02:59:50,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:50,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2008439410, now seen corresponding path program 1 times [2024-11-17 02:59:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486660986] [2024-11-17 02:59:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:50,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486660986] [2024-11-17 02:59:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486660986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:50,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:59:50,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398443771] [2024-11-17 02:59:50,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:50,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:50,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:50,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:50,585 INFO L87 Difference]: Start difference. First operand 3489 states and 5988 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-17 02:59:50,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:50,686 INFO L93 Difference]: Finished difference Result 3351 states and 5782 transitions. [2024-11-17 02:59:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:50,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-17 02:59:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:50,707 INFO L225 Difference]: With dead ends: 3351 [2024-11-17 02:59:50,707 INFO L226 Difference]: Without dead ends: 3351 [2024-11-17 02:59:50,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:50,708 INFO L432 NwaCegarLoop]: 2980 mSDtfsCounter, 61 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5906 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:50,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5906 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:59:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2024-11-17 02:59:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3351. [2024-11-17 02:59:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 2047 states have (on average 1.8417195896433805) internal successors, (3770), 3342 states have internal predecessors, (3770), 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-17 02:59:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 5782 transitions. [2024-11-17 02:59:50,947 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 5782 transitions. Word has length 20 [2024-11-17 02:59:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:50,947 INFO L471 AbstractCegarLoop]: Abstraction has 3351 states and 5782 transitions. [2024-11-17 02:59:50,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-17 02:59:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 5782 transitions. [2024-11-17 02:59:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 02:59:50,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:50,949 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] [2024-11-17 02:59:50,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 02:59:50,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:50,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1669973231, now seen corresponding path program 1 times [2024-11-17 02:59:50,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:50,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24677850] [2024-11-17 02:59:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:51,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:51,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24677850] [2024-11-17 02:59:51,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24677850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:51,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:51,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:51,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529032675] [2024-11-17 02:59:51,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:51,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:51,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:51,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:51,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:51,020 INFO L87 Difference]: Start difference. First operand 3351 states and 5782 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:51,171 INFO L93 Difference]: Finished difference Result 3322 states and 5732 transitions. [2024-11-17 02:59:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:51,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 02:59:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:51,185 INFO L225 Difference]: With dead ends: 3322 [2024-11-17 02:59:51,185 INFO L226 Difference]: Without dead ends: 3322 [2024-11-17 02:59:51,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:51,187 INFO L432 NwaCegarLoop]: 2945 mSDtfsCounter, 41 mSDsluCounter, 5861 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8806 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:51,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8806 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:59:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2024-11-17 02:59:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3316. [2024-11-17 02:59:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3316 states, 2019 states have (on average 1.839524517087667) internal successors, (3714), 3307 states have internal predecessors, (3714), 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-17 02:59:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 5726 transitions. [2024-11-17 02:59:51,416 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 5726 transitions. Word has length 22 [2024-11-17 02:59:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:51,416 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 5726 transitions. [2024-11-17 02:59:51,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 5726 transitions. [2024-11-17 02:59:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 02:59:51,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:51,417 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] [2024-11-17 02:59:51,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 02:59:51,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:51,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:51,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1371846617, now seen corresponding path program 1 times [2024-11-17 02:59:51,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:51,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956907999] [2024-11-17 02:59:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:51,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956907999] [2024-11-17 02:59:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956907999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:51,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:51,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:59:51,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690506664] [2024-11-17 02:59:51,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:51,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:51,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:51,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:51,584 INFO L87 Difference]: Start difference. First operand 3316 states and 5726 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:54,199 INFO L93 Difference]: Finished difference Result 6111 states and 10856 transitions. [2024-11-17 02:59:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:59:54,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-17 02:59:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:54,227 INFO L225 Difference]: With dead ends: 6111 [2024-11-17 02:59:54,228 INFO L226 Difference]: Without dead ends: 6111 [2024-11-17 02:59:54,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:54,229 INFO L432 NwaCegarLoop]: 2784 mSDtfsCounter, 1831 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2331 SdHoareTripleChecker+Valid, 6341 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:54,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2331 Valid, 6341 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-17 02:59:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6111 states. [2024-11-17 02:59:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6111 to 3312. [2024-11-17 02:59:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 2019 states have (on average 1.8355621594848934) internal successors, (3706), 3303 states have internal predecessors, (3706), 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-17 02:59:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 5718 transitions. [2024-11-17 02:59:54,693 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 5718 transitions. Word has length 36 [2024-11-17 02:59:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:54,694 INFO L471 AbstractCegarLoop]: Abstraction has 3312 states and 5718 transitions. [2024-11-17 02:59:54,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 5718 transitions. [2024-11-17 02:59:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-17 02:59:54,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:54,697 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] [2024-11-17 02:59:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 02:59:54,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash -179136829, now seen corresponding path program 1 times [2024-11-17 02:59:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416081734] [2024-11-17 02:59:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:54,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416081734] [2024-11-17 02:59:54,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416081734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:54,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000261561] [2024-11-17 02:59:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:54,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:59:54,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:54,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:59:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:59:54,877 INFO L87 Difference]: Start difference. First operand 3312 states and 5718 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:55,010 INFO L93 Difference]: Finished difference Result 3312 states and 5710 transitions. [2024-11-17 02:59:55,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:59:55,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71 [2024-11-17 02:59:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:55,021 INFO L225 Difference]: With dead ends: 3312 [2024-11-17 02:59:55,022 INFO L226 Difference]: Without dead ends: 3312 [2024-11-17 02:59:55,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:55,023 INFO L432 NwaCegarLoop]: 2940 mSDtfsCounter, 21 mSDsluCounter, 5848 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8788 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:55,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8788 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:59:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2024-11-17 02:59:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2024-11-17 02:59:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 2019 states have (on average 1.8315998018821198) internal successors, (3698), 3303 states have internal predecessors, (3698), 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-17 02:59:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 5710 transitions. [2024-11-17 02:59:55,236 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 5710 transitions. Word has length 71 [2024-11-17 02:59:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:55,236 INFO L471 AbstractCegarLoop]: Abstraction has 3312 states and 5710 transitions. [2024-11-17 02:59:55,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 5710 transitions. [2024-11-17 02:59:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-17 02:59:55,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:55,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:55,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 02:59:55,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:55,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 138523515, now seen corresponding path program 1 times [2024-11-17 02:59:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:55,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727457043] [2024-11-17 02:59:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:55,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:55,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:55,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727457043] [2024-11-17 02:59:55,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727457043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:55,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:55,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:59:55,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857253581] [2024-11-17 02:59:55,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:55,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:59:55,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:55,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:59:55,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:55,403 INFO L87 Difference]: Start difference. First operand 3312 states and 5710 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:55,576 INFO L93 Difference]: Finished difference Result 5829 states and 10439 transitions. [2024-11-17 02:59:55,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:59:55,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-17 02:59:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:55,598 INFO L225 Difference]: With dead ends: 5829 [2024-11-17 02:59:55,599 INFO L226 Difference]: Without dead ends: 5829 [2024-11-17 02:59:55,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:59:55,600 INFO L432 NwaCegarLoop]: 3236 mSDtfsCounter, 1357 mSDsluCounter, 2910 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 6146 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:55,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 6146 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:59:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5829 states. [2024-11-17 02:59:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5829 to 5771. [2024-11-17 02:59:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5771 states, 3478 states have (on average 1.8467510063254744) internal successors, (6423), 5762 states have internal predecessors, (6423), 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-17 02:59:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5771 states to 5771 states and 10435 transitions. [2024-11-17 02:59:56,057 INFO L78 Accepts]: Start accepts. Automaton has 5771 states and 10435 transitions. Word has length 79 [2024-11-17 02:59:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:56,060 INFO L471 AbstractCegarLoop]: Abstraction has 5771 states and 10435 transitions. [2024-11-17 02:59:56,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 5771 states and 10435 transitions. [2024-11-17 02:59:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 02:59:56,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:56,062 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] [2024-11-17 02:59:56,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 02:59:56,062 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:56,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1540448519, now seen corresponding path program 1 times [2024-11-17 02:59:56,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:56,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22258522] [2024-11-17 02:59:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:56,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:56,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22258522] [2024-11-17 02:59:56,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22258522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:56,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:56,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:56,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051099223] [2024-11-17 02:59:56,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:56,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:59:56,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:56,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:59:56,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:56,573 INFO L87 Difference]: Start difference. First operand 5771 states and 10435 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:57,541 INFO L93 Difference]: Finished difference Result 5770 states and 10433 transitions. [2024-11-17 02:59:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:59:57,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2024-11-17 02:59:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:57,561 INFO L225 Difference]: With dead ends: 5770 [2024-11-17 02:59:57,561 INFO L226 Difference]: Without dead ends: 5770 [2024-11-17 02:59:57,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:59:57,562 INFO L432 NwaCegarLoop]: 2951 mSDtfsCounter, 2 mSDsluCounter, 7800 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10751 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:57,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10751 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 02:59:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2024-11-17 02:59:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5770. [2024-11-17 02:59:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5770 states, 3478 states have (on average 1.8461759631972399) internal successors, (6421), 5761 states have internal predecessors, (6421), 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-17 02:59:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 10433 transitions. [2024-11-17 02:59:58,031 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 10433 transitions. Word has length 87 [2024-11-17 02:59:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:58,031 INFO L471 AbstractCegarLoop]: Abstraction has 5770 states and 10433 transitions. [2024-11-17 02:59:58,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 10433 transitions. [2024-11-17 02:59:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 02:59:58,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:58,033 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] [2024-11-17 02:59:58,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 02:59:58,033 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:58,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1540448518, now seen corresponding path program 1 times [2024-11-17 02:59:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:58,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490569019] [2024-11-17 02:59:58,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:58,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:58,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:58,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490569019] [2024-11-17 02:59:58,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490569019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:58,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:58,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:59:58,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881736995] [2024-11-17 02:59:58,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:58,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:59:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:58,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:59:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:59:58,343 INFO L87 Difference]: Start difference. First operand 5770 states and 10433 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:59:59,164 INFO L93 Difference]: Finished difference Result 5769 states and 10431 transitions. [2024-11-17 02:59:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:59:59,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2024-11-17 02:59:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:59:59,182 INFO L225 Difference]: With dead ends: 5769 [2024-11-17 02:59:59,182 INFO L226 Difference]: Without dead ends: 5769 [2024-11-17 02:59:59,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:59:59,184 INFO L432 NwaCegarLoop]: 2951 mSDtfsCounter, 1 mSDsluCounter, 7859 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10810 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:59:59,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10810 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:59:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2024-11-17 02:59:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5769. [2024-11-17 02:59:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5769 states, 3476 states have (on average 1.8466628308400461) internal successors, (6419), 5760 states have internal predecessors, (6419), 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-17 02:59:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 10431 transitions. [2024-11-17 02:59:59,674 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 10431 transitions. Word has length 87 [2024-11-17 02:59:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:59:59,674 INFO L471 AbstractCegarLoop]: Abstraction has 5769 states and 10431 transitions. [2024-11-17 02:59:59,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:59:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 10431 transitions. [2024-11-17 02:59:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:59:59,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:59:59,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:59:59,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 02:59:59,678 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:59:59,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:59:59,679 INFO L85 PathProgramCache]: Analyzing trace with hash -900863261, now seen corresponding path program 1 times [2024-11-17 02:59:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:59:59,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295727334] [2024-11-17 02:59:59,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:59:59,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:59:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:59,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:59:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:59:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:59:59,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:59:59,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295727334] [2024-11-17 02:59:59,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295727334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:59:59,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:59:59,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:59:59,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229566301] [2024-11-17 02:59:59,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:59:59,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:59:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:59:59,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:59:59,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:59:59,998 INFO L87 Difference]: Start difference. First operand 5769 states and 10431 transitions. Second operand has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:00:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:05,027 INFO L93 Difference]: Finished difference Result 5787 states and 10457 transitions. [2024-11-17 03:00:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:00:05,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-17 03:00:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:05,060 INFO L225 Difference]: With dead ends: 5787 [2024-11-17 03:00:05,060 INFO L226 Difference]: Without dead ends: 5787 [2024-11-17 03:00:05,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:00:05,062 INFO L432 NwaCegarLoop]: 2936 mSDtfsCounter, 17 mSDsluCounter, 9911 mSDsCounter, 0 mSdLazyCounter, 4553 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12847 SdHoareTripleChecker+Invalid, 5058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 4553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:05,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12847 Invalid, 5058 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [505 Valid, 4553 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-17 03:00:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2024-11-17 03:00:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 5778. [2024-11-17 03:00:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5778 states, 3484 states have (on average 1.8455797933409874) internal successors, (6430), 5767 states have internal predecessors, (6430), 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-17 03:00:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5778 states to 5778 states and 10447 transitions. [2024-11-17 03:00:05,558 INFO L78 Accepts]: Start accepts. Automaton has 5778 states and 10447 transitions. Word has length 95 [2024-11-17 03:00:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:05,559 INFO L471 AbstractCegarLoop]: Abstraction has 5778 states and 10447 transitions. [2024-11-17 03:00:05,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:00:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5778 states and 10447 transitions. [2024-11-17 03:00:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 03:00:05,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:05,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:05,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 03:00:05,560 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 03:00:05,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash -900863260, now seen corresponding path program 1 times [2024-11-17 03:00:05,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:05,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214955959] [2024-11-17 03:00:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:05,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 03:00:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:00:06,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:06,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214955959] [2024-11-17 03:00:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214955959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:06,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:06,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:00:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492229957] [2024-11-17 03:00:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:06,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:00:06,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:06,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:00:06,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:00:06,246 INFO L87 Difference]: Start difference. First operand 5778 states and 10447 transitions. Second operand has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:00:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:10,123 INFO L93 Difference]: Finished difference Result 5778 states and 10445 transitions. [2024-11-17 03:00:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:00:10,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-17 03:00:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:10,141 INFO L225 Difference]: With dead ends: 5778 [2024-11-17 03:00:10,142 INFO L226 Difference]: Without dead ends: 5778 [2024-11-17 03:00:10,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:00:10,142 INFO L432 NwaCegarLoop]: 2940 mSDtfsCounter, 18 mSDsluCounter, 8102 mSDsCounter, 0 mSdLazyCounter, 3369 mSolverCounterSat, 1007 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 11042 SdHoareTripleChecker+Invalid, 4376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1007 IncrementalHoareTripleChecker+Valid, 3369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:10,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 11042 Invalid, 4376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1007 Valid, 3369 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-17 03:00:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2024-11-17 03:00:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 5778. [2024-11-17 03:00:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5778 states, 3484 states have (on average 1.8450057405281286) internal successors, (6428), 5767 states have internal predecessors, (6428), 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-17 03:00:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5778 states to 5778 states and 10445 transitions. [2024-11-17 03:00:10,714 INFO L78 Accepts]: Start accepts. Automaton has 5778 states and 10445 transitions. Word has length 95 [2024-11-17 03:00:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:10,714 INFO L471 AbstractCegarLoop]: Abstraction has 5778 states and 10445 transitions. [2024-11-17 03:00:10,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:00:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5778 states and 10445 transitions. [2024-11-17 03:00:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 03:00:10,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:10,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:10,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 03:00:10,717 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 03:00:10,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:10,722 INFO L85 PathProgramCache]: Analyzing trace with hash 555875252, now seen corresponding path program 1 times [2024-11-17 03:00:10,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:10,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182446306] [2024-11-17 03:00:10,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:10,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:11,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 03:00:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:00:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:11,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182446306] [2024-11-17 03:00:11,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182446306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:00:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284889041] [2024-11-17 03:00:11,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:11,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:00:11,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:00:11,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 03:00:11,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 03:00:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:11,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 03:00:11,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:00:11,771 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 03:00:11,772 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-17 03:00:11,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 03:00:11,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 03:00:12,090 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:00:12,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 03:00:12,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 03:00:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:00:12,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:00:12,206 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_591 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_591) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-17 03:00:12,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284889041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:00:12,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:00:12,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-17 03:00:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637274041] [2024-11-17 03:00:12,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:00:12,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 03:00:12,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:12,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 03:00:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-17 03:00:12,210 INFO L87 Difference]: Start difference. First operand 5778 states and 10445 transitions. Second operand has 19 states, 16 states have (on average 7.5625) internal successors, (121), 18 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 03:00:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:24,707 INFO L93 Difference]: Finished difference Result 5785 states and 10451 transitions. [2024-11-17 03:00:24,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 03:00:24,708 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.5625) internal successors, (121), 18 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-17 03:00:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:24,725 INFO L225 Difference]: With dead ends: 5785 [2024-11-17 03:00:24,725 INFO L226 Difference]: Without dead ends: 5785 [2024-11-17 03:00:24,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 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-17 03:00:24,726 INFO L432 NwaCegarLoop]: 2603 mSDtfsCounter, 1903 mSDsluCounter, 21054 mSDsCounter, 0 mSdLazyCounter, 15123 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 23657 SdHoareTripleChecker+Invalid, 15641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 15123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:24,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 23657 Invalid, 15641 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [518 Valid, 15123 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2024-11-17 03:00:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2024-11-17 03:00:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5782. [2024-11-17 03:00:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 3488 states have (on average 1.84375) internal successors, (6431), 5770 states have internal predecessors, (6431), 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-17 03:00:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 10445 transitions. [2024-11-17 03:00:25,197 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 10445 transitions. Word has length 96 [2024-11-17 03:00:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:25,198 INFO L471 AbstractCegarLoop]: Abstraction has 5782 states and 10445 transitions. [2024-11-17 03:00:25,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.5625) internal successors, (121), 18 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 03:00:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 10445 transitions. [2024-11-17 03:00:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 03:00:25,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:25,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:25,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 03:00:25,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 03:00:25,404 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 03:00:25,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash 555875253, now seen corresponding path program 1 times [2024-11-17 03:00:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:25,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685543789] [2024-11-17 03:00:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 03:00:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:00:26,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685543789] [2024-11-17 03:00:26,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685543789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:00:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650283366] [2024-11-17 03:00:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:26,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:00:26,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:00:26,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 03:00:26,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 03:00:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:26,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 03:00:26,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:00:26,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 03:00:26,537 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 03:00:26,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 03:00:26,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 03:00:26,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 03:00:26,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 03:00:26,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 03:00:26,726 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:00:26,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-17 03:00:26,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 03:00:26,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 03:00:26,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 03:00:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:00:26,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:00:26,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_740 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 03:00:26,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650283366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:00:26,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:00:26,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-17 03:00:26,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362172900] [2024-11-17 03:00:26,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:00:26,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 03:00:26,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:26,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 03:00:26,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-17 03:00:26,910 INFO L87 Difference]: Start difference. First operand 5782 states and 10445 transitions. Second operand has 16 states, 13 states have (on average 8.846153846153847) internal successors, (115), 15 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 03:00:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:38,486 INFO L93 Difference]: Finished difference Result 5784 states and 10449 transitions. [2024-11-17 03:00:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:00:38,486 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.846153846153847) internal successors, (115), 15 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-17 03:00:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:38,501 INFO L225 Difference]: With dead ends: 5784 [2024-11-17 03:00:38,502 INFO L226 Difference]: Without dead ends: 5784 [2024-11-17 03:00:38,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 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-17 03:00:38,503 INFO L432 NwaCegarLoop]: 2606 mSDtfsCounter, 1901 mSDsluCounter, 17723 mSDsCounter, 0 mSdLazyCounter, 11460 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2405 SdHoareTripleChecker+Valid, 20329 SdHoareTripleChecker+Invalid, 11977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 11460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:38,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2405 Valid, 20329 Invalid, 11977 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 11460 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2024-11-17 03:00:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2024-11-17 03:00:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5772. [2024-11-17 03:00:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5772 states, 3480 states have (on average 1.8448275862068966) internal successors, (6420), 5762 states have internal predecessors, (6420), 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-17 03:00:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 10432 transitions. [2024-11-17 03:00:38,998 INFO L78 Accepts]: Start accepts. Automaton has 5772 states and 10432 transitions. Word has length 96 [2024-11-17 03:00:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:38,998 INFO L471 AbstractCegarLoop]: Abstraction has 5772 states and 10432 transitions. [2024-11-17 03:00:38,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.846153846153847) internal successors, (115), 15 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 03:00:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 5772 states and 10432 transitions. [2024-11-17 03:00:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 03:00:39,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:39,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:39,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 03:00:39,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-17 03:00:39,202 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 03:00:39,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1637092882, now seen corresponding path program 1 times [2024-11-17 03:00:39,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:39,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412923543] [2024-11-17 03:00:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:39,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 03:00:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:00:39,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:39,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412923543] [2024-11-17 03:00:39,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412923543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:39,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:39,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 03:00:39,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147220630] [2024-11-17 03:00:39,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:39,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 03:00:39,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:39,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 03:00:39,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 03:00:39,746 INFO L87 Difference]: Start difference. First operand 5772 states and 10432 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)