./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:42:18,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:42:18,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:42:18,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:42:18,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:42:18,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:42:18,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:42:18,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:42:18,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:42:18,820 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:42:18,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:42:18,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:42:18,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:42:18,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:42:18,823 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:42:18,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:42:18,824 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:42:18,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:42:18,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:42:18,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:42:18,825 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:42:18,829 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:42:18,829 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:42:18,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:42:18,830 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:42:18,830 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:42:18,830 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:42:18,830 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:42:18,830 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:42:18,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:42:18,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:42:18,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:42:18,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:42:18,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:42:18,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:42:18,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:42:18,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:42:18,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:42:18,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:42:18,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:42:18,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:42:18,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:42:18,836 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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2024-11-10 17:42:19,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:42:19,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:42:19,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:42:19,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:42:19,111 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:42:19,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-11-10 17:42:20,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:42:20,883 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:42:20,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-11-10 17:42:20,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef6463f47/b74c1cefa0224790a5fc48f2c790779f/FLAG0e41f14be [2024-11-10 17:42:20,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef6463f47/b74c1cefa0224790a5fc48f2c790779f [2024-11-10 17:42:20,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:42:20,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:42:20,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:42:20,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:42:20,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:42:20,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:42:20" (1/1) ... [2024-11-10 17:42:20,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf89641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:20, skipping insertion in model container [2024-11-10 17:42:20,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:42:20" (1/1) ... [2024-11-10 17:42:20,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:42:21,410 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-10 17:42:21,441 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-10 17:42:21,449 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-10 17:42:21,453 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-10 17:42:21,462 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-10 17:42:21,507 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-10 17:42:21,513 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-10 17:42:21,515 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-10 17:42:21,521 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-10 17:42:21,565 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-10 17:42:21,566 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-10 17:42:21,577 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-10 17:42:21,578 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-10 17:42:21,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:42:21,604 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:42:21,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:42:21,737 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:42:21,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21 WrapperNode [2024-11-10 17:42:21,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:42:21,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:42:21,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:42:21,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:42:21,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:21,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:21,862 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2006 [2024-11-10 17:42:21,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:42:21,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:42:21,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:42:21,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:42:21,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:21,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:21,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:22,005 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2024-11-10 17:42:22,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:22,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:22,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:22,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:22,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:22,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:22,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:42:22,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:42:22,137 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:42:22,138 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:42:22,138 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (1/1) ... [2024-11-10 17:42:22,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:42:22,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:42:22,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:42:22,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:42:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 17:42:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 17:42:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 17:42:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 17:42:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 17:42:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:42:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:42:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 17:42:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 17:42:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 17:42:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:42:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:42:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:42:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:42:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:42:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:42:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:42:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:42:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:42:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:42:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:42:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:42:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:42:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:42:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:42:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:42:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:42:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 17:42:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 17:42:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:42:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:42:22,474 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:42:22,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:42:25,030 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2024-11-10 17:42:25,219 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-10 17:42:25,219 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:42:25,320 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:42:25,322 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 17:42:25,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:42:25 BoogieIcfgContainer [2024-11-10 17:42:25,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:42:25,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:42:25,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:42:25,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:42:25,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:42:20" (1/3) ... [2024-11-10 17:42:25,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfbfdcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:42:25, skipping insertion in model container [2024-11-10 17:42:25,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:42:21" (2/3) ... [2024-11-10 17:42:25,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfbfdcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:42:25, skipping insertion in model container [2024-11-10 17:42:25,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:42:25" (3/3) ... [2024-11-10 17:42:25,331 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2024-11-10 17:42:25,348 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:42:25,349 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 712 error locations. [2024-11-10 17:42:25,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:42:25,437 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;@4316007d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:42:25,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-10 17:42:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 1768 states, 1045 states have (on average 2.0047846889952154) internal successors, (2095), 1758 states have internal predecessors, (2095), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:42:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:42:25,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:25,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:42:25,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr709REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:25,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1279329309, now seen corresponding path program 1 times [2024-11-10 17:42:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065443632] [2024-11-10 17:42:25,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:25,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:25,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065443632] [2024-11-10 17:42:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065443632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:25,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:25,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:42:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331979636] [2024-11-10 17:42:25,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:25,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:42:25,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:25,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:42:25,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:42:25,670 INFO L87 Difference]: Start difference. First operand has 1768 states, 1045 states have (on average 2.0047846889952154) internal successors, (2095), 1758 states have internal predecessors, (2095), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:25,849 INFO L93 Difference]: Finished difference Result 1746 states and 2006 transitions. [2024-11-10 17:42:25,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:42:25,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:42:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:25,872 INFO L225 Difference]: With dead ends: 1746 [2024-11-10 17:42:25,872 INFO L226 Difference]: Without dead ends: 1743 [2024-11-10 17:42:25,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:42:25,877 INFO L432 NwaCegarLoop]: 1943 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:25,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1943 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:42:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2024-11-10 17:42:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2024-11-10 17:42:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1032 states have (on average 1.9176356589147288) internal successors, (1979), 1733 states have internal predecessors, (1979), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2003 transitions. [2024-11-10 17:42:25,984 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2003 transitions. Word has length 6 [2024-11-10 17:42:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:25,985 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2003 transitions. [2024-11-10 17:42:25,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2003 transitions. [2024-11-10 17:42:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:42:25,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:25,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:42:25,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:42:25,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr709REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:25,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:25,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1279329340, now seen corresponding path program 1 times [2024-11-10 17:42:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:25,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252736476] [2024-11-10 17:42:25,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:25,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:26,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:26,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252736476] [2024-11-10 17:42:26,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252736476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:26,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:26,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:42:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430428719] [2024-11-10 17:42:26,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:26,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:42:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:26,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:42:26,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:42:26,138 INFO L87 Difference]: Start difference. First operand 1743 states and 2003 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:27,330 INFO L93 Difference]: Finished difference Result 1980 states and 2328 transitions. [2024-11-10 17:42:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:42:27,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:42:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:27,342 INFO L225 Difference]: With dead ends: 1980 [2024-11-10 17:42:27,342 INFO L226 Difference]: Without dead ends: 1980 [2024-11-10 17:42:27,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:42:27,346 INFO L432 NwaCegarLoop]: 1541 mSDtfsCounter, 1763 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:27,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 1859 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:42:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2024-11-10 17:42:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1651. [2024-11-10 17:42:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1032 states have (on average 1.8284883720930232) internal successors, (1887), 1641 states have internal predecessors, (1887), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 1911 transitions. [2024-11-10 17:42:27,409 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 1911 transitions. Word has length 6 [2024-11-10 17:42:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:27,409 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 1911 transitions. [2024-11-10 17:42:27,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 1911 transitions. [2024-11-10 17:42:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:42:27,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:27,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:42:27,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:42:27,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr710REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:27,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1279329341, now seen corresponding path program 1 times [2024-11-10 17:42:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078862049] [2024-11-10 17:42:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:27,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078862049] [2024-11-10 17:42:27,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078862049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:27,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:27,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:42:27,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890893684] [2024-11-10 17:42:27,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:27,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:42:27,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:27,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:42:27,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:42:27,532 INFO L87 Difference]: Start difference. First operand 1651 states and 1911 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:28,851 INFO L93 Difference]: Finished difference Result 2404 states and 2828 transitions. [2024-11-10 17:42:28,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:42:28,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:42:28,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:28,859 INFO L225 Difference]: With dead ends: 2404 [2024-11-10 17:42:28,859 INFO L226 Difference]: Without dead ends: 2404 [2024-11-10 17:42:28,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:42:28,861 INFO L432 NwaCegarLoop]: 1909 mSDtfsCounter, 1236 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:28,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 2823 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:42:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-11-10 17:42:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1921. [2024-11-10 17:42:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1312 states have (on average 1.8048780487804879) internal successors, (2368), 1911 states have internal predecessors, (2368), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2392 transitions. [2024-11-10 17:42:28,906 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2392 transitions. Word has length 6 [2024-11-10 17:42:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:28,906 INFO L471 AbstractCegarLoop]: Abstraction has 1921 states and 2392 transitions. [2024-11-10 17:42:28,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2392 transitions. [2024-11-10 17:42:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:42:28,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:28,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:42:28,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:42:28,908 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:28,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1020955448, now seen corresponding path program 1 times [2024-11-10 17:42:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850481010] [2024-11-10 17:42:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:28,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850481010] [2024-11-10 17:42:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850481010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:28,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:28,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:42:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036750689] [2024-11-10 17:42:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:28,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:42:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:28,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:42:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:42:28,963 INFO L87 Difference]: Start difference. First operand 1921 states and 2392 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:29,174 INFO L93 Difference]: Finished difference Result 3822 states and 4764 transitions. [2024-11-10 17:42:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:42:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 17:42:29,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:29,186 INFO L225 Difference]: With dead ends: 3822 [2024-11-10 17:42:29,187 INFO L226 Difference]: Without dead ends: 3822 [2024-11-10 17:42:29,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:42:29,188 INFO L432 NwaCegarLoop]: 2067 mSDtfsCounter, 1855 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 3894 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:29,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 3894 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:42:29,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2024-11-10 17:42:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 1925. [2024-11-10 17:42:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1316 states have (on average 1.8024316109422491) internal successors, (2372), 1915 states have internal predecessors, (2372), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2396 transitions. [2024-11-10 17:42:29,278 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2396 transitions. Word has length 8 [2024-11-10 17:42:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:29,279 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2396 transitions. [2024-11-10 17:42:29,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2396 transitions. [2024-11-10 17:42:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:42:29,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:29,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:42:29,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:42:29,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr705REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:29,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1400782018, now seen corresponding path program 1 times [2024-11-10 17:42:29,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:29,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917920603] [2024-11-10 17:42:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:29,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:29,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917920603] [2024-11-10 17:42:29,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917920603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:29,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:29,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:42:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100995611] [2024-11-10 17:42:29,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:29,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:42:29,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:29,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:42:29,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:42:29,402 INFO L87 Difference]: Start difference. First operand 1925 states and 2396 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-10 17:42:30,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:30,726 INFO L93 Difference]: Finished difference Result 1951 states and 2449 transitions. [2024-11-10 17:42:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:42:30,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-10 17:42:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:30,733 INFO L225 Difference]: With dead ends: 1951 [2024-11-10 17:42:30,734 INFO L226 Difference]: Without dead ends: 1951 [2024-11-10 17:42:30,734 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-10 17:42:30,735 INFO L432 NwaCegarLoop]: 1123 mSDtfsCounter, 2031 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:30,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2042 Valid, 2112 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:42:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2024-11-10 17:42:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1902. [2024-11-10 17:42:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1316 states have (on average 1.784954407294833) internal successors, (2349), 1892 states have internal predecessors, (2349), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2373 transitions. [2024-11-10 17:42:30,765 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2373 transitions. Word has length 13 [2024-11-10 17:42:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:30,765 INFO L471 AbstractCegarLoop]: Abstraction has 1902 states and 2373 transitions. [2024-11-10 17:42:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-10 17:42:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2373 transitions. [2024-11-10 17:42:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:42:30,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:30,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:42:30,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:42:30,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr706REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:30,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:30,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1400782017, now seen corresponding path program 1 times [2024-11-10 17:42:30,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:30,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063695727] [2024-11-10 17:42:30,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:30,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:30,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:30,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063695727] [2024-11-10 17:42:30,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063695727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:30,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:30,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:42:30,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272963458] [2024-11-10 17:42:30,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:30,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:42:30,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:30,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:42:30,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:42:30,823 INFO L87 Difference]: Start difference. First operand 1902 states and 2373 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10 17:42:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:30,935 INFO L93 Difference]: Finished difference Result 1827 states and 2270 transitions. [2024-11-10 17:42:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:42:30,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10 17:42:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:30,941 INFO L225 Difference]: With dead ends: 1827 [2024-11-10 17:42:30,941 INFO L226 Difference]: Without dead ends: 1827 [2024-11-10 17:42:30,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:42:30,942 INFO L432 NwaCegarLoop]: 1709 mSDtfsCounter, 61 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:30,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3364 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:42:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2024-11-10 17:42:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1827. [2024-11-10 17:42:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1253 states have (on average 1.7924980047885075) internal successors, (2246), 1817 states have internal predecessors, (2246), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2270 transitions. [2024-11-10 17:42:30,970 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2270 transitions. Word has length 13 [2024-11-10 17:42:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:30,970 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2270 transitions. [2024-11-10 17:42:30,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10 17:42:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2270 transitions. [2024-11-10 17:42:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 17:42:30,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:30,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:42:30,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:42:30,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:30,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1826839390, now seen corresponding path program 1 times [2024-11-10 17:42:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:30,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591078667] [2024-11-10 17:42:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:31,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591078667] [2024-11-10 17:42:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591078667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:31,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:31,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:42:31,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286859576] [2024-11-10 17:42:31,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:31,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:42:31,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:31,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:42:31,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:42:31,047 INFO L87 Difference]: Start difference. First operand 1827 states and 2270 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:31,246 INFO L93 Difference]: Finished difference Result 1812 states and 2248 transitions. [2024-11-10 17:42:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:42:31,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 17:42:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:31,253 INFO L225 Difference]: With dead ends: 1812 [2024-11-10 17:42:31,254 INFO L226 Difference]: Without dead ends: 1812 [2024-11-10 17:42:31,254 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-10 17:42:31,254 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 45 mSDsluCounter, 3318 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4989 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:31,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4989 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:42:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-10 17:42:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1812. [2024-11-10 17:42:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1245 states have (on average 1.7863453815261043) internal successors, (2224), 1802 states have internal predecessors, (2224), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2248 transitions. [2024-11-10 17:42:31,288 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2248 transitions. Word has length 15 [2024-11-10 17:42:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:31,288 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2248 transitions. [2024-11-10 17:42:31,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2248 transitions. [2024-11-10 17:42:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 17:42:31,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:31,290 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] [2024-11-10 17:42:31,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:42:31,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr668REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:31,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2106893528, now seen corresponding path program 1 times [2024-11-10 17:42:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:31,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26373189] [2024-11-10 17:42:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:31,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:31,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26373189] [2024-11-10 17:42:31,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26373189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:31,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:31,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:42:31,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115463174] [2024-11-10 17:42:31,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:31,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:42:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:31,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:42:31,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:42:31,437 INFO L87 Difference]: Start difference. First operand 1812 states and 2248 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:32,762 INFO L93 Difference]: Finished difference Result 2342 states and 2758 transitions. [2024-11-10 17:42:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:42:32,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-11-10 17:42:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:32,771 INFO L225 Difference]: With dead ends: 2342 [2024-11-10 17:42:32,773 INFO L226 Difference]: Without dead ends: 2342 [2024-11-10 17:42:32,774 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-10 17:42:32,775 INFO L432 NwaCegarLoop]: 1405 mSDtfsCounter, 1241 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:32,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 3311 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:42:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2024-11-10 17:42:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 1808. [2024-11-10 17:42:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1245 states have (on average 1.783132530120482) internal successors, (2220), 1798 states have internal predecessors, (2220), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2244 transitions. [2024-11-10 17:42:32,806 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2244 transitions. Word has length 29 [2024-11-10 17:42:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:32,806 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2244 transitions. [2024-11-10 17:42:32,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2244 transitions. [2024-11-10 17:42:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 17:42:32,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:32,808 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] [2024-11-10 17:42:32,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:42:32,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:32,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:32,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1736803853, now seen corresponding path program 1 times [2024-11-10 17:42:32,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:32,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79102912] [2024-11-10 17:42:32,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:32,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:32,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79102912] [2024-11-10 17:42:32,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79102912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:32,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:42:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455997746] [2024-11-10 17:42:32,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:32,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:42:32,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:32,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:42:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:42:32,917 INFO L87 Difference]: Start difference. First operand 1808 states and 2244 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:33,077 INFO L93 Difference]: Finished difference Result 1802 states and 2234 transitions. [2024-11-10 17:42:33,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:42:33,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-10 17:42:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:33,083 INFO L225 Difference]: With dead ends: 1802 [2024-11-10 17:42:33,083 INFO L226 Difference]: Without dead ends: 1802 [2024-11-10 17:42:33,083 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-10 17:42:33,085 INFO L432 NwaCegarLoop]: 1669 mSDtfsCounter, 21 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4975 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:33,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4975 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:42:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-10 17:42:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2024-11-10 17:42:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1239 states have (on average 1.7836965294592413) internal successors, (2210), 1792 states have internal predecessors, (2210), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2234 transitions. [2024-11-10 17:42:33,109 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2234 transitions. Word has length 64 [2024-11-10 17:42:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:33,111 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2234 transitions. [2024-11-10 17:42:33,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2234 transitions. [2024-11-10 17:42:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 17:42:33,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:33,114 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] [2024-11-10 17:42:33,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:42:33,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:33,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash -475789525, now seen corresponding path program 1 times [2024-11-10 17:42:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:33,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663744370] [2024-11-10 17:42:33,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663744370] [2024-11-10 17:42:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663744370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:33,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:33,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:42:33,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527191988] [2024-11-10 17:42:33,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:33,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:42:33,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:33,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:42:33,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:42:33,214 INFO L87 Difference]: Start difference. First operand 1802 states and 2234 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:33,344 INFO L93 Difference]: Finished difference Result 1896 states and 2355 transitions. [2024-11-10 17:42:33,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:42:33,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2024-11-10 17:42:33,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:33,351 INFO L225 Difference]: With dead ends: 1896 [2024-11-10 17:42:33,351 INFO L226 Difference]: Without dead ends: 1896 [2024-11-10 17:42:33,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:42:33,352 INFO L432 NwaCegarLoop]: 1684 mSDtfsCounter, 54 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3341 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:33,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3341 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:42:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2024-11-10 17:42:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2024-11-10 17:42:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1333 states have (on average 1.7486871717929482) internal successors, (2331), 1886 states have internal predecessors, (2331), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2355 transitions. [2024-11-10 17:42:33,377 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2355 transitions. Word has length 72 [2024-11-10 17:42:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:33,378 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2355 transitions. [2024-11-10 17:42:33,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2355 transitions. [2024-11-10 17:42:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 17:42:33,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:33,382 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] [2024-11-10 17:42:33,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:42:33,382 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:33,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash -854221678, now seen corresponding path program 1 times [2024-11-10 17:42:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680722929] [2024-11-10 17:42:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:33,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:33,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:33,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680722929] [2024-11-10 17:42:33,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680722929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:33,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:33,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:42:33,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786408399] [2024-11-10 17:42:33,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:33,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:42:33,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:33,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:42:33,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:42:33,888 INFO L87 Difference]: Start difference. First operand 1896 states and 2355 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:35,156 INFO L93 Difference]: Finished difference Result 1812 states and 2271 transitions. [2024-11-10 17:42:35,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:42:35,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 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 75 [2024-11-10 17:42:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:35,163 INFO L225 Difference]: With dead ends: 1812 [2024-11-10 17:42:35,163 INFO L226 Difference]: Without dead ends: 1812 [2024-11-10 17:42:35,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:42:35,164 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 1580 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:35,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 1566 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:42:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-10 17:42:35,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1532. [2024-11-10 17:42:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1053 states have (on average 1.667616334283001) internal successors, (1756), 1522 states have internal predecessors, (1756), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1780 transitions. [2024-11-10 17:42:35,188 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1780 transitions. Word has length 75 [2024-11-10 17:42:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:35,189 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1780 transitions. [2024-11-10 17:42:35,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1780 transitions. [2024-11-10 17:42:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:42:35,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:35,190 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] [2024-11-10 17:42:35,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:42:35,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr617REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:35,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1472879306, now seen corresponding path program 1 times [2024-11-10 17:42:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:35,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540490761] [2024-11-10 17:42:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:35,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540490761] [2024-11-10 17:42:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540490761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:35,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:35,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:42:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761410751] [2024-11-10 17:42:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:35,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:42:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:35,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:42:35,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:42:35,460 INFO L87 Difference]: Start difference. First operand 1532 states and 1780 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:36,520 INFO L93 Difference]: Finished difference Result 1531 states and 1779 transitions. [2024-11-10 17:42:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:42:36,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2024-11-10 17:42:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:36,525 INFO L225 Difference]: With dead ends: 1531 [2024-11-10 17:42:36,525 INFO L226 Difference]: Without dead ends: 1531 [2024-11-10 17:42:36,525 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-10 17:42:36,526 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 2 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4664 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:36,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4664 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:42:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-11-10 17:42:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2024-11-10 17:42:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1053 states have (on average 1.6666666666666667) internal successors, (1755), 1521 states have internal predecessors, (1755), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1779 transitions. [2024-11-10 17:42:36,547 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1779 transitions. Word has length 80 [2024-11-10 17:42:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1779 transitions. [2024-11-10 17:42:36,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1779 transitions. [2024-11-10 17:42:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:42:36,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:36,549 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] [2024-11-10 17:42:36,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 17:42:36,549 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr618REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:36,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1472879305, now seen corresponding path program 1 times [2024-11-10 17:42:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:36,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255288514] [2024-11-10 17:42:36,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:37,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255288514] [2024-11-10 17:42:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255288514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:37,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:37,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:42:37,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298437191] [2024-11-10 17:42:37,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:37,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:42:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:37,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:42:37,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:42:37,035 INFO L87 Difference]: Start difference. First operand 1531 states and 1779 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:38,092 INFO L93 Difference]: Finished difference Result 1530 states and 1778 transitions. [2024-11-10 17:42:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:42:38,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2024-11-10 17:42:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:38,097 INFO L225 Difference]: With dead ends: 1530 [2024-11-10 17:42:38,097 INFO L226 Difference]: Without dead ends: 1530 [2024-11-10 17:42:38,098 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-10 17:42:38,098 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 1 mSDsluCounter, 3096 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4692 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:38,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4692 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:42:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-10 17:42:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2024-11-10 17:42:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1052 states have (on average 1.667300380228137) internal successors, (1754), 1520 states have internal predecessors, (1754), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1778 transitions. [2024-11-10 17:42:38,117 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1778 transitions. Word has length 80 [2024-11-10 17:42:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:38,118 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 1778 transitions. [2024-11-10 17:42:38,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:42:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1778 transitions. [2024-11-10 17:42:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:42:38,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:38,119 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] [2024-11-10 17:42:38,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 17:42:38,119 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:38,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1481159437, now seen corresponding path program 1 times [2024-11-10 17:42:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:38,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649717305] [2024-11-10 17:42:38,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:38,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:42:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:38,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:38,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649717305] [2024-11-10 17:42:38,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649717305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:38,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:38,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:42:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245864703] [2024-11-10 17:42:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:38,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:42:38,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:38,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:42:38,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:42:38,352 INFO L87 Difference]: Start difference. First operand 1530 states and 1778 transitions. Second operand has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 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-10 17:42:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:40,111 INFO L93 Difference]: Finished difference Result 1542 states and 1796 transitions. [2024-11-10 17:42:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:42:40,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 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 88 [2024-11-10 17:42:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:40,121 INFO L225 Difference]: With dead ends: 1542 [2024-11-10 17:42:40,121 INFO L226 Difference]: Without dead ends: 1542 [2024-11-10 17:42:40,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 17:42:40,122 INFO L432 NwaCegarLoop]: 1578 mSDtfsCounter, 17 mSDsluCounter, 5632 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7210 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:40,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7210 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:42:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-10 17:42:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1536. [2024-11-10 17:42:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1057 states have (on average 1.6660359508041627) internal successors, (1761), 1525 states have internal predecessors, (1761), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-10 17:42:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1791 transitions. [2024-11-10 17:42:40,157 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 1791 transitions. Word has length 88 [2024-11-10 17:42:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:40,157 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 1791 transitions. [2024-11-10 17:42:40,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 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-10 17:42:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1791 transitions. [2024-11-10 17:42:40,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:42:40,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:40,158 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] [2024-11-10 17:42:40,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 17:42:40,158 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:40,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1481159436, now seen corresponding path program 1 times [2024-11-10 17:42:40,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:40,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957955261] [2024-11-10 17:42:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:40,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:42:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:40,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:40,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957955261] [2024-11-10 17:42:40,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957955261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:40,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:40,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:42:40,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577601404] [2024-11-10 17:42:40,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:40,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:42:40,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:40,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:42:40,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:42:40,718 INFO L87 Difference]: Start difference. First operand 1536 states and 1791 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-10 17:42:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:42,299 INFO L93 Difference]: Finished difference Result 1536 states and 1790 transitions. [2024-11-10 17:42:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:42:42,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 88 [2024-11-10 17:42:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:42,303 INFO L225 Difference]: With dead ends: 1536 [2024-11-10 17:42:42,304 INFO L226 Difference]: Without dead ends: 1536 [2024-11-10 17:42:42,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:42:42,304 INFO L432 NwaCegarLoop]: 1585 mSDtfsCounter, 18 mSDsluCounter, 4414 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5999 SdHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:42,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5999 Invalid, 2262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:42:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-10 17:42:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1536. [2024-11-10 17:42:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1057 states have (on average 1.6650898770104068) internal successors, (1760), 1525 states have internal predecessors, (1760), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-10 17:42:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1790 transitions. [2024-11-10 17:42:42,354 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 1790 transitions. Word has length 88 [2024-11-10 17:42:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:42,354 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 1790 transitions. [2024-11-10 17:42:42,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-10 17:42:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1790 transitions. [2024-11-10 17:42:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:42:42,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:42,355 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] [2024-11-10 17:42:42,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 17:42:42,357 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:42,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1674677226, now seen corresponding path program 1 times [2024-11-10 17:42:42,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:42,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119115820] [2024-11-10 17:42:42,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:42:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:42,855 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-10 17:42:42,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:42,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119115820] [2024-11-10 17:42:42,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119115820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:42:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349083063] [2024-11-10 17:42:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:42,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:42:42,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:42:42,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:42:42,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 17:42:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:43,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 17:42:43,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:42:43,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:42:43,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:42:43,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:42:43,282 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-10 17:42:43,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:42:43,376 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-10 17:42:43,407 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-10 17:42:43,409 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-10 17:42:43,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:42:43,463 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 17:42:43,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 17:42:43,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349083063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:42:43,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:42:43,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-10 17:42:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875696378] [2024-11-10 17:42:43,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:42:43,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:42:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:43,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:42:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=195, Unknown=7, NotChecked=0, Total=240 [2024-11-10 17:42:43,509 INFO L87 Difference]: Start difference. First operand 1536 states and 1790 transitions. Second operand has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:42:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:46,821 INFO L93 Difference]: Finished difference Result 1535 states and 1789 transitions. [2024-11-10 17:42:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:42:46,822 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-10 17:42:46,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:46,825 INFO L225 Difference]: With dead ends: 1535 [2024-11-10 17:42:46,825 INFO L226 Difference]: Without dead ends: 1535 [2024-11-10 17:42:46,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=451, Unknown=8, NotChecked=0, Total=552 [2024-11-10 17:42:46,826 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 1569 mSDsluCounter, 8955 mSDsCounter, 0 mSdLazyCounter, 6510 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 9972 SdHoareTripleChecker+Invalid, 6536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:46,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 9972 Invalid, 6536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6510 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-10 17:42:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-11-10 17:42:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535. [2024-11-10 17:42:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1057 states have (on average 1.664143803216651) internal successors, (1759), 1524 states have internal predecessors, (1759), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-10 17:42:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1789 transitions. [2024-11-10 17:42:46,846 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 1789 transitions. Word has length 89 [2024-11-10 17:42:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:46,846 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 1789 transitions. [2024-11-10 17:42:46,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:42:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1789 transitions. [2024-11-10 17:42:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:42:46,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:46,847 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] [2024-11-10 17:42:46,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 17:42:47,048 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-10 17:42:47,050 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:47,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1674677225, now seen corresponding path program 1 times [2024-11-10 17:42:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:47,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350723082] [2024-11-10 17:42:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:47,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:42:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:47,812 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-10 17:42:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350723082] [2024-11-10 17:42:47,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350723082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:42:47,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583757917] [2024-11-10 17:42:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:47,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:42:47,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:42:47,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:42:47,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 17:42:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:48,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 17:42:48,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:42:48,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:42:48,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:42:48,194 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:42:48,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:42:48,208 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-10 17:42:48,217 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-10 17:42:48,279 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-10 17:42:48,284 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-10 17:42:48,392 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:42:48,392 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-10 17:42:48,399 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-10 17:42:48,433 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-10 17:42:48,436 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-10 17:42:48,439 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-10 17:42:48,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:42:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583757917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:42:48,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:42:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2024-11-10 17:42:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614041358] [2024-11-10 17:42:48,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:42:48,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:42:48,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:42:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=274, Unknown=12, NotChecked=0, Total=342 [2024-11-10 17:42:48,578 INFO L87 Difference]: Start difference. First operand 1535 states and 1789 transitions. Second operand has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 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-10 17:42:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:52,132 INFO L93 Difference]: Finished difference Result 1542 states and 1796 transitions. [2024-11-10 17:42:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 17:42:52,133 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 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 89 [2024-11-10 17:42:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:52,136 INFO L225 Difference]: With dead ends: 1542 [2024-11-10 17:42:52,136 INFO L226 Difference]: Without dead ends: 1542 [2024-11-10 17:42:52,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=445, Unknown=15, NotChecked=0, Total=552 [2024-11-10 17:42:52,137 INFO L432 NwaCegarLoop]: 1022 mSDtfsCounter, 1576 mSDsluCounter, 6840 mSDsCounter, 0 mSdLazyCounter, 6988 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 7862 SdHoareTripleChecker+Invalid, 7026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 6988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:52,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 7862 Invalid, 7026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 6988 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-10 17:42:52,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-10 17:42:52,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1533. [2024-11-10 17:42:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1056 states have (on average 1.6638257575757576) internal successors, (1757), 1522 states have internal predecessors, (1757), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:42:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1781 transitions. [2024-11-10 17:42:52,157 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1781 transitions. Word has length 89 [2024-11-10 17:42:52,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:52,157 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1781 transitions. [2024-11-10 17:42:52,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 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-10 17:42:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1781 transitions. [2024-11-10 17:42:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 17:42:52,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:52,158 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] [2024-11-10 17:42:52,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 17:42:52,362 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-10 17:42:52,363 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:52,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:52,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1274952067, now seen corresponding path program 1 times [2024-11-10 17:42:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:52,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511676889] [2024-11-10 17:42:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:52,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:42:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511676889] [2024-11-10 17:42:52,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511676889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:52,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:52,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:42:52,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183553989] [2024-11-10 17:42:52,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:52,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:42:52,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:52,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:42:52,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:42:52,876 INFO L87 Difference]: Start difference. First operand 1533 states and 1781 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 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-10 17:42:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:56,018 INFO L93 Difference]: Finished difference Result 1546 states and 1800 transitions. [2024-11-10 17:42:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:42:56,018 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 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 91 [2024-11-10 17:42:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:56,021 INFO L225 Difference]: With dead ends: 1546 [2024-11-10 17:42:56,021 INFO L226 Difference]: Without dead ends: 1546 [2024-11-10 17:42:56,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-10 17:42:56,022 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 1574 mSDsluCounter, 10898 mSDsCounter, 0 mSdLazyCounter, 7864 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 11914 SdHoareTripleChecker+Invalid, 7889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:56,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 11914 Invalid, 7889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7864 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-10 17:42:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-11-10 17:42:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1542. [2024-11-10 17:42:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1064 states have (on average 1.6607142857142858) internal successors, (1767), 1530 states have internal predecessors, (1767), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:42:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1792 transitions. [2024-11-10 17:42:56,048 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1792 transitions. Word has length 91 [2024-11-10 17:42:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1792 transitions. [2024-11-10 17:42:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 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-10 17:42:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1792 transitions. [2024-11-10 17:42:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 17:42:56,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:56,050 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] [2024-11-10 17:42:56,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 17:42:56,050 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:56,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1274952068, now seen corresponding path program 1 times [2024-11-10 17:42:56,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:56,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200540078] [2024-11-10 17:42:56,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:56,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:42:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:42:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:42:56,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:42:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200540078] [2024-11-10 17:42:56,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200540078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:42:56,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:42:56,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 17:42:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073882765] [2024-11-10 17:42:56,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:42:56,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 17:42:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:42:56,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 17:42:56,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 17:42:56,705 INFO L87 Difference]: Start difference. First operand 1542 states and 1792 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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-10 17:42:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:42:59,851 INFO L93 Difference]: Finished difference Result 1545 states and 1799 transitions. [2024-11-10 17:42:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:42:59,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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 91 [2024-11-10 17:42:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:42:59,854 INFO L225 Difference]: With dead ends: 1545 [2024-11-10 17:42:59,855 INFO L226 Difference]: Without dead ends: 1545 [2024-11-10 17:42:59,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:42:59,855 INFO L432 NwaCegarLoop]: 1023 mSDtfsCounter, 1591 mSDsluCounter, 6848 mSDsCounter, 0 mSdLazyCounter, 6956 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 7871 SdHoareTripleChecker+Invalid, 6980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:42:59,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 7871 Invalid, 6980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6956 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-10 17:42:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-10 17:42:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1542. [2024-11-10 17:42:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1064 states have (on average 1.6597744360902256) internal successors, (1766), 1530 states have internal predecessors, (1766), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:42:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1791 transitions. [2024-11-10 17:42:59,877 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1791 transitions. Word has length 91 [2024-11-10 17:42:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:42:59,878 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1791 transitions. [2024-11-10 17:42:59,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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-10 17:42:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1791 transitions. [2024-11-10 17:42:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:42:59,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:42:59,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:42:59,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 17:42:59,879 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:42:59,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:42:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash 32611200, now seen corresponding path program 1 times [2024-11-10 17:42:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:42:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654022726] [2024-11-10 17:42:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:42:59,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:42:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:43:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:00,396 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-10 17:43:00,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:43:00,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654022726] [2024-11-10 17:43:00,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654022726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:43:00,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128617633] [2024-11-10 17:43:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:00,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:43:00,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:43:00,399 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:43:00,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 17:43:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:00,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 17:43:00,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:43:00,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:43:00,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:43:00,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:43:00,781 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-10 17:43:00,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:43:00,840 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-10 17:43:00,882 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:43:00,882 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-10 17:43:00,896 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-10 17:43:00,899 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-10 17:43:00,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:43:00,911 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:43:00,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_946) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:43:00,965 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-10 17:43:00,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-10 17:43:00,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128617633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:43:00,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:43:00,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-10 17:43:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990963042] [2024-11-10 17:43:00,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:43:00,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 17:43:00,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:43:00,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 17:43:00,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=257, Unknown=6, NotChecked=66, Total=380 [2024-11-10 17:43:00,995 INFO L87 Difference]: Start difference. First operand 1542 states and 1791 transitions. Second operand has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 15 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:43:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:43:03,370 INFO L93 Difference]: Finished difference Result 1544 states and 1798 transitions. [2024-11-10 17:43:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:43:03,371 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 15 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-10 17:43:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:43:03,373 INFO L225 Difference]: With dead ends: 1544 [2024-11-10 17:43:03,374 INFO L226 Difference]: Without dead ends: 1544 [2024-11-10 17:43:03,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=543, Unknown=6, NotChecked=98, Total=756 [2024-11-10 17:43:03,375 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 1565 mSDsluCounter, 7948 mSDsCounter, 0 mSdLazyCounter, 5869 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 8964 SdHoareTripleChecker+Invalid, 5894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:43:03,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 8964 Invalid, 5894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5869 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:43:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-10 17:43:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1541. [2024-11-10 17:43:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1064 states have (on average 1.6588345864661653) internal successors, (1765), 1529 states have internal predecessors, (1765), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:43:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 1790 transitions. [2024-11-10 17:43:03,415 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 1790 transitions. Word has length 92 [2024-11-10 17:43:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:43:03,415 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 1790 transitions. [2024-11-10 17:43:03,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 15 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:43:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1790 transitions. [2024-11-10 17:43:03,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:43:03,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:43:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:43:03,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 17:43:03,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:43:03,621 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:43:03,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:43:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash 32611201, now seen corresponding path program 1 times [2024-11-10 17:43:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:43:03,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860780818] [2024-11-10 17:43:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:03,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:43:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:43:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:04,382 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-10 17:43:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:43:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860780818] [2024-11-10 17:43:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860780818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:43:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972275436] [2024-11-10 17:43:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:04,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:43:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:43:04,386 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:43:04,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 17:43:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:04,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 17:43:04,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:43:04,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:43:04,756 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:43:04,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:43:04,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:43:04,789 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-10 17:43:04,797 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-10 17:43:04,873 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-10 17:43:04,877 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-10 17:43:04,969 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:43:04,969 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-10 17:43:04,973 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-10 17:43:05,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:43:05,045 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-10 17:43:05,049 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-10 17:43:05,065 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-10 17:43:05,068 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-10 17:43:05,086 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-10 17:43:05,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:43:05,146 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1097) |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~mem52#1.base| v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1097 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:43:05,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1102))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1103) .cse0 v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1097 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-10 17:43:05,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972275436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:43:05,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:43:05,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-10 17:43:05,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059486928] [2024-11-10 17:43:05,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:43:05,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 17:43:05,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:43:05,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 17:43:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=473, Unknown=4, NotChecked=90, Total=650 [2024-11-10 17:43:05,247 INFO L87 Difference]: Start difference. First operand 1541 states and 1790 transitions. Second operand has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 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-10 17:43:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:43:09,795 INFO L93 Difference]: Finished difference Result 1543 states and 1797 transitions. [2024-11-10 17:43:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:43:09,795 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 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 92 [2024-11-10 17:43:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:43:09,798 INFO L225 Difference]: With dead ends: 1543 [2024-11-10 17:43:09,798 INFO L226 Difference]: Without dead ends: 1543 [2024-11-10 17:43:09,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=737, Unknown=4, NotChecked=114, Total=992 [2024-11-10 17:43:09,800 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 1571 mSDsluCounter, 9722 mSDsCounter, 0 mSdLazyCounter, 10721 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 10743 SdHoareTripleChecker+Invalid, 10761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 10721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:43:09,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 10743 Invalid, 10761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 10721 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-10 17:43:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-11-10 17:43:09,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1531. [2024-11-10 17:43:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1056 states have (on average 1.6619318181818181) internal successors, (1755), 1520 states have internal predecessors, (1755), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:43:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1779 transitions. [2024-11-10 17:43:09,817 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1779 transitions. Word has length 92 [2024-11-10 17:43:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:43:09,818 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1779 transitions. [2024-11-10 17:43:09,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 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-10 17:43:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1779 transitions. [2024-11-10 17:43:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 17:43:09,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:43:09,819 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] [2024-11-10 17:43:09,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 17:43:10,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:43:10,024 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:43:10,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:43:10,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1702963148, now seen corresponding path program 1 times [2024-11-10 17:43:10,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:43:10,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599144322] [2024-11-10 17:43:10,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:10,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:43:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:43:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:43:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:43:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599144322] [2024-11-10 17:43:10,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599144322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:43:10,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:43:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 17:43:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768316079] [2024-11-10 17:43:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:43:10,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:43:10,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:43:10,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:43:10,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 17:43:10,609 INFO L87 Difference]: Start difference. First operand 1531 states and 1779 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 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-10 17:43:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:43:13,115 INFO L93 Difference]: Finished difference Result 1547 states and 1801 transitions. [2024-11-10 17:43:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:43:13,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 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 94 [2024-11-10 17:43:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:43:13,118 INFO L225 Difference]: With dead ends: 1547 [2024-11-10 17:43:13,119 INFO L226 Difference]: Without dead ends: 1547 [2024-11-10 17:43:13,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-10 17:43:13,120 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 1579 mSDsluCounter, 7917 mSDsCounter, 0 mSdLazyCounter, 5906 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 8932 SdHoareTripleChecker+Invalid, 5932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:43:13,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 8932 Invalid, 5932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5906 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:43:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-11-10 17:43:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1543. [2024-11-10 17:43:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1067 states have (on average 1.6569821930646673) internal successors, (1768), 1531 states have internal predecessors, (1768), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:43:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1793 transitions. [2024-11-10 17:43:13,137 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1793 transitions. Word has length 94 [2024-11-10 17:43:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:43:13,137 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 1793 transitions. [2024-11-10 17:43:13,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 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-10 17:43:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1793 transitions. [2024-11-10 17:43:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 17:43:13,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:43:13,138 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] [2024-11-10 17:43:13,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 17:43:13,138 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:43:13,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:43:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1702963149, now seen corresponding path program 1 times [2024-11-10 17:43:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:43:13,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640930285] [2024-11-10 17:43:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:13,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:43:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:43:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:43:13,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:43:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640930285] [2024-11-10 17:43:13,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640930285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:43:13,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:43:13,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 17:43:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249086087] [2024-11-10 17:43:13,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:43:13,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 17:43:13,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:43:13,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 17:43:13,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 17:43:13,943 INFO L87 Difference]: Start difference. First operand 1543 states and 1793 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 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-10 17:43:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:43:16,413 INFO L93 Difference]: Finished difference Result 1546 states and 1800 transitions. [2024-11-10 17:43:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:43:16,413 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 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 94 [2024-11-10 17:43:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:43:16,416 INFO L225 Difference]: With dead ends: 1546 [2024-11-10 17:43:16,416 INFO L226 Difference]: Without dead ends: 1546 [2024-11-10 17:43:16,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-10 17:43:16,417 INFO L432 NwaCegarLoop]: 1022 mSDtfsCounter, 1599 mSDsluCounter, 5081 mSDsCounter, 0 mSdLazyCounter, 5443 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 6103 SdHoareTripleChecker+Invalid, 5479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 5443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:43:16,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 6103 Invalid, 5479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 5443 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:43:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-11-10 17:43:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1543. [2024-11-10 17:43:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1067 states have (on average 1.656044985941893) internal successors, (1767), 1531 states have internal predecessors, (1767), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:43:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1792 transitions. [2024-11-10 17:43:16,435 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1792 transitions. Word has length 94 [2024-11-10 17:43:16,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:43:16,435 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 1792 transitions. [2024-11-10 17:43:16,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 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-10 17:43:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1792 transitions. [2024-11-10 17:43:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:43:16,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:43:16,436 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-10 17:43:16,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 17:43:16,437 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:43:16,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:43:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash 859383983, now seen corresponding path program 1 times [2024-11-10 17:43:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:43:16,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023825086] [2024-11-10 17:43:16,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:43:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:43:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:17,014 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-10 17:43:17,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:43:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023825086] [2024-11-10 17:43:17,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023825086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:43:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572102162] [2024-11-10 17:43:17,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:17,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:43:17,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:43:17,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:43:17,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 17:43:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:17,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 17:43:17,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:43:17,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:43:17,400 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:43:17,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:43:17,407 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-10 17:43:17,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:43:17,474 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-10 17:43:17,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:43:17,511 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-10 17:43:17,544 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:43:17,544 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-10 17:43:17,558 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-10 17:43:17,560 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-10 17:43:17,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:43:17,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1391 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:43:17,574 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1391 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1391) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:43:17,686 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-10 17:43:17,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-10 17:43:17,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1394))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1390)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1391)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-10 17:43:17,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572102162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:43:17,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:43:17,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-10 17:43:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809930390] [2024-11-10 17:43:17,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:43:17,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 17:43:17,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:43:17,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 17:43:17,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=381, Unknown=20, NotChecked=126, Total=600 [2024-11-10 17:43:17,698 INFO L87 Difference]: Start difference. First operand 1543 states and 1792 transitions. Second operand has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:43:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:43:20,826 INFO L93 Difference]: Finished difference Result 1545 states and 1799 transitions. [2024-11-10 17:43:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:43:20,826 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-11-10 17:43:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:43:20,829 INFO L225 Difference]: With dead ends: 1545 [2024-11-10 17:43:20,829 INFO L226 Difference]: Without dead ends: 1545 [2024-11-10 17:43:20,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=771, Unknown=25, NotChecked=180, Total=1122 [2024-11-10 17:43:20,830 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 1559 mSDsluCounter, 10874 mSDsCounter, 0 mSdLazyCounter, 7847 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 11889 SdHoareTripleChecker+Invalid, 7873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:43:20,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 11889 Invalid, 7873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 7847 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 17:43:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-10 17:43:20,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1542. [2024-11-10 17:43:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1067 states have (on average 1.655107778819119) internal successors, (1766), 1530 states have internal predecessors, (1766), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:43:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1791 transitions. [2024-11-10 17:43:20,845 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1791 transitions. Word has length 95 [2024-11-10 17:43:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:43:20,845 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1791 transitions. [2024-11-10 17:43:20,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:43:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1791 transitions. [2024-11-10 17:43:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:43:20,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:43:20,847 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-10 17:43:20,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 17:43:21,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 17:43:21,048 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:43:21,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:43:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash 859383984, now seen corresponding path program 1 times [2024-11-10 17:43:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:43:21,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800125719] [2024-11-10 17:43:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:43:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:43:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:21,893 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-10 17:43:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:43:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800125719] [2024-11-10 17:43:21,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800125719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:43:21,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123773561] [2024-11-10 17:43:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:21,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:43:21,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:43:21,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:43:21,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 17:43:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:22,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 17:43:22,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:43:22,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:43:22,240 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:43:22,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:43:22,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:43:22,253 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-10 17:43:22,255 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-10 17:43:22,288 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-10 17:43:22,290 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-10 17:43:22,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:43:22,363 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-10 17:43:22,368 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-10 17:43:22,422 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:43:22,422 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-10 17:43:22,428 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-10 17:43:22,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:43:22,472 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-10 17:43:22,476 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-10 17:43:22,494 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-10 17:43:22,498 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-10 17:43:22,499 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-10 17:43:22,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:43:22,555 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1556 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:43:22,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1556 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:43:22,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1553))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1554) .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1554) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-10 17:43:22,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1554) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1553))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1554) .cse2 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-10 17:43:22,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1561))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1562) .cse0 v_ArrVal_1554) (select (select (store .cse1 .cse0 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1556))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1561))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1553))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1554) .cse4 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-10 17:43:22,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123773561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:43:22,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:43:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-10 17:43:22,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923988417] [2024-11-10 17:43:22,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:43:22,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 17:43:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:43:22,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 17:43:22,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=362, Unknown=5, NotChecked=210, Total=650 [2024-11-10 17:43:22,650 INFO L87 Difference]: Start difference. First operand 1542 states and 1791 transitions. Second operand has 19 states, 17 states have (on average 8.352941176470589) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:43:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:43:27,480 INFO L93 Difference]: Finished difference Result 1544 states and 1798 transitions. [2024-11-10 17:43:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:43:27,481 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.352941176470589) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-11-10 17:43:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:43:27,485 INFO L225 Difference]: With dead ends: 1544 [2024-11-10 17:43:27,486 INFO L226 Difference]: Without dead ends: 1544 [2024-11-10 17:43:27,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=749, Unknown=5, NotChecked=300, Total=1190 [2024-11-10 17:43:27,487 INFO L432 NwaCegarLoop]: 1013 mSDtfsCounter, 1566 mSDsluCounter, 8881 mSDsCounter, 0 mSdLazyCounter, 9874 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 9894 SdHoareTripleChecker+Invalid, 9902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:43:27,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 9894 Invalid, 9902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9874 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-10 17:43:27,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-10 17:43:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1529. [2024-11-10 17:43:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1056 states have (on average 1.660037878787879) internal successors, (1753), 1518 states have internal predecessors, (1753), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:43:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1777 transitions. [2024-11-10 17:43:27,502 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1777 transitions. Word has length 95 [2024-11-10 17:43:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:43:27,502 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 1777 transitions. [2024-11-10 17:43:27,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.352941176470589) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:43:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1777 transitions. [2024-11-10 17:43:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 17:43:27,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:43:27,503 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] [2024-11-10 17:43:27,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 17:43:27,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:43:27,704 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:43:27,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:43:27,705 INFO L85 PathProgramCache]: Analyzing trace with hash 823168444, now seen corresponding path program 1 times [2024-11-10 17:43:27,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:43:27,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046659379] [2024-11-10 17:43:27,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:27,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:43:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:43:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:43:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:43:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:43:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046659379] [2024-11-10 17:43:28,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046659379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:43:28,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:43:28,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 17:43:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752278993] [2024-11-10 17:43:28,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:43:28,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:43:28,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:43:28,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:43:28,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:43:28,275 INFO L87 Difference]: Start difference. First operand 1529 states and 1777 transitions. Second operand has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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-10 17:43:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:43:30,967 INFO L93 Difference]: Finished difference Result 1548 states and 1802 transitions. [2024-11-10 17:43:30,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:43:30,968 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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 97 [2024-11-10 17:43:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:43:30,970 INFO L225 Difference]: With dead ends: 1548 [2024-11-10 17:43:30,971 INFO L226 Difference]: Without dead ends: 1548 [2024-11-10 17:43:30,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:43:30,971 INFO L432 NwaCegarLoop]: 1014 mSDtfsCounter, 1582 mSDsluCounter, 8909 mSDsCounter, 0 mSdLazyCounter, 6545 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 9923 SdHoareTripleChecker+Invalid, 6571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:43:30,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 9923 Invalid, 6571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6545 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 17:43:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-10 17:43:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1544. [2024-11-10 17:43:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1070 states have (on average 1.6532710280373832) internal successors, (1769), 1532 states have internal predecessors, (1769), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:43:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1794 transitions. [2024-11-10 17:43:30,988 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1794 transitions. Word has length 97 [2024-11-10 17:43:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:43:30,988 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1794 transitions. [2024-11-10 17:43:30,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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-10 17:43:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1794 transitions. [2024-11-10 17:43:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 17:43:30,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:43:30,990 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] [2024-11-10 17:43:30,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 17:43:30,990 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:43:30,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:43:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash 823168445, now seen corresponding path program 1 times [2024-11-10 17:43:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:43:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826228605] [2024-11-10 17:43:30,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:43:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:43:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat