./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-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 c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:47:03,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:47:03,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:47:03,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:47:03,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:47:03,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:47:03,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:47:03,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:47:03,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:47:03,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:47:03,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:47:03,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:47:03,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:47:03,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:47:03,363 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:47:03,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:47:03,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:47:03,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:47:03,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:47:03,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:47:03,365 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:47:03,366 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:47:03,367 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:47:03,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:47:03,367 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:47:03,367 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:47:03,368 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:47:03,368 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:47:03,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:47:03,369 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:47:03,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:47:03,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:47:03,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:47:03,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:47:03,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:47:03,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:47:03,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:47:03,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:47:03,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:47:03,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:47:03,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:47:03,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:47:03,375 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 -> c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e [2024-11-17 02:47:03,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:47:03,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:47:03,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:47:03,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:47:03,664 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:47:03,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2024-11-17 02:47:05,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:47:05,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:47:05,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2024-11-17 02:47:05,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4179a2a9/d25df3d5e75e4ebea03dbd778208014d/FLAGdca33af31 [2024-11-17 02:47:05,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4179a2a9/d25df3d5e75e4ebea03dbd778208014d [2024-11-17 02:47:05,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:47:05,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:47:05,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:47:05,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:47:05,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:47:05,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:47:05" (1/1) ... [2024-11-17 02:47:05,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77112f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:05, skipping insertion in model container [2024-11-17 02:47:05,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:47:05" (1/1) ... [2024-11-17 02:47:05,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:47:06,016 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:47:06,058 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:47:06,064 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:47:06,071 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:47:06,083 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:47:06,131 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:47:06,131 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:47:06,134 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:47:06,135 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:47:06,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:47:06,167 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:47:06,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:47:06,341 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:47:06,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06 WrapperNode [2024-11-17 02:47:06,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:47:06,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:47:06,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:47:06,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:47:06,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,452 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1282 [2024-11-17 02:47:06,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:47:06,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:47:06,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:47:06,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:47:06,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,558 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-17 02:47:06,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:47:06,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:47:06,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:47:06,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:47:06,653 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (1/1) ... [2024-11-17 02:47:06,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:47:06,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:06,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 02:47:06,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 02:47:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 02:47:06,765 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 02:47:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:47:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:47:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 02:47:06,766 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:47:06,766 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:47:06,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 02:47:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 02:47:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:47:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:47:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 02:47:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:47:06,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 02:47:06,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 02:47:06,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 02:47:06,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 02:47:06,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 02:47:06,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 02:47:06,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 02:47:06,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 02:47:06,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:47:06,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:47:06,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:47:06,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:47:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 02:47:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 02:47:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 02:47:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 02:47:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:47:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:47:07,033 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:47:07,035 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:47:08,984 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 02:47:09,150 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2024-11-17 02:47:09,150 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:47:09,245 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:47:09,245 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 02:47:09,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:47:09 BoogieIcfgContainer [2024-11-17 02:47:09,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:47:09,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:47:09,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:47:09,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:47:09,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:47:05" (1/3) ... [2024-11-17 02:47:09,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de295ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:47:09, skipping insertion in model container [2024-11-17 02:47:09,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:47:06" (2/3) ... [2024-11-17 02:47:09,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de295ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:47:09, skipping insertion in model container [2024-11-17 02:47:09,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:47:09" (3/3) ... [2024-11-17 02:47:09,256 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-1.i [2024-11-17 02:47:09,273 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:47:09,273 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-11-17 02:47:09,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:47:09,363 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;@6e43842c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:47:09,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-17 02:47:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 1096 states, 661 states have (on average 1.9818456883509834) internal successors, (1310), 1089 states have internal predecessors, (1310), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-17 02:47:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:47:09,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:09,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:47:09,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:09,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1401090, now seen corresponding path program 1 times [2024-11-17 02:47:09,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:09,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476465787] [2024-11-17 02:47:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:09,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476465787] [2024-11-17 02:47:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476465787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:09,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:09,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:47:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610266642] [2024-11-17 02:47:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:09,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:47:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:09,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:47:09,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:09,679 INFO L87 Difference]: Start difference. First operand has 1096 states, 661 states have (on average 1.9818456883509834) internal successors, (1310), 1089 states have internal predecessors, (1310), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:10,434 INFO L93 Difference]: Finished difference Result 1081 states and 1255 transitions. [2024-11-17 02:47:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:47:10,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 02:47:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:10,461 INFO L225 Difference]: With dead ends: 1081 [2024-11-17 02:47:10,461 INFO L226 Difference]: Without dead ends: 1078 [2024-11-17 02:47:10,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:10,466 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 1118 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:10,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 877 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:47:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-11-17 02:47:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2024-11-17 02:47:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 661 states have (on average 1.8668683812405447) internal successors, (1234), 1071 states have internal predecessors, (1234), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 02:47:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1252 transitions. [2024-11-17 02:47:10,556 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1252 transitions. Word has length 3 [2024-11-17 02:47:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:10,557 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1252 transitions. [2024-11-17 02:47:10,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1252 transitions. [2024-11-17 02:47:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:47:10,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:10,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:47:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 02:47:10,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:10,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1401091, now seen corresponding path program 1 times [2024-11-17 02:47:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:10,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876948731] [2024-11-17 02:47:10,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:10,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:10,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876948731] [2024-11-17 02:47:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876948731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:10,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:10,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:47:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437192717] [2024-11-17 02:47:10,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:10,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:47:10,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:10,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:47:10,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:10,685 INFO L87 Difference]: Start difference. First operand 1078 states and 1252 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:11,660 INFO L93 Difference]: Finished difference Result 1865 states and 2201 transitions. [2024-11-17 02:47:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:47:11,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 02:47:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:11,669 INFO L225 Difference]: With dead ends: 1865 [2024-11-17 02:47:11,669 INFO L226 Difference]: Without dead ends: 1865 [2024-11-17 02:47:11,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:11,671 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 931 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:11,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1698 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 02:47:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2024-11-17 02:47:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1601. [2024-11-17 02:47:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1180 states have (on average 1.8296610169491525) internal successors, (2159), 1592 states have internal predecessors, (2159), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 02:47:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2191 transitions. [2024-11-17 02:47:11,723 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2191 transitions. Word has length 3 [2024-11-17 02:47:11,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:11,723 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2191 transitions. [2024-11-17 02:47:11,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2191 transitions. [2024-11-17 02:47:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:47:11,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:11,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:11,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 02:47:11,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:11,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:11,726 INFO L85 PathProgramCache]: Analyzing trace with hash -972013480, now seen corresponding path program 1 times [2024-11-17 02:47:11,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:11,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491434168] [2024-11-17 02:47:11,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:11,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:11,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:11,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491434168] [2024-11-17 02:47:11,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491434168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:11,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:11,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:47:11,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250469202] [2024-11-17 02:47:11,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:11,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:47:11,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:11,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:47:11,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:11,838 INFO L87 Difference]: Start difference. First operand 1601 states and 2191 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:12,600 INFO L93 Difference]: Finished difference Result 1882 states and 2536 transitions. [2024-11-17 02:47:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:47:12,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-17 02:47:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:12,611 INFO L225 Difference]: With dead ends: 1882 [2024-11-17 02:47:12,611 INFO L226 Difference]: Without dead ends: 1882 [2024-11-17 02:47:12,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:12,613 INFO L432 NwaCegarLoop]: 1142 mSDtfsCounter, 1103 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:12,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1457 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:47:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2024-11-17 02:47:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1554. [2024-11-17 02:47:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1180 states have (on average 1.769491525423729) internal successors, (2088), 1545 states have internal predecessors, (2088), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 02:47:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2120 transitions. [2024-11-17 02:47:12,665 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2120 transitions. Word has length 9 [2024-11-17 02:47:12,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:12,666 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2120 transitions. [2024-11-17 02:47:12,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2120 transitions. [2024-11-17 02:47:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:47:12,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:12,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:12,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 02:47:12,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:12,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash -972013479, now seen corresponding path program 1 times [2024-11-17 02:47:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:12,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562355821] [2024-11-17 02:47:12,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:12,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:12,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:12,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562355821] [2024-11-17 02:47:12,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562355821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:12,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:12,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:47:12,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930069083] [2024-11-17 02:47:12,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:12,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:47:12,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:12,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:47:12,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:12,799 INFO L87 Difference]: Start difference. First operand 1554 states and 2120 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:13,510 INFO L93 Difference]: Finished difference Result 2111 states and 2913 transitions. [2024-11-17 02:47:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:47:13,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-17 02:47:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:13,518 INFO L225 Difference]: With dead ends: 2111 [2024-11-17 02:47:13,518 INFO L226 Difference]: Without dead ends: 2111 [2024-11-17 02:47:13,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:13,520 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 892 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:13,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1706 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:47:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2024-11-17 02:47:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1529. [2024-11-17 02:47:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1180 states have (on average 1.7279661016949153) internal successors, (2039), 1520 states have internal predecessors, (2039), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 02:47:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2071 transitions. [2024-11-17 02:47:13,582 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2071 transitions. Word has length 9 [2024-11-17 02:47:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:13,582 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2071 transitions. [2024-11-17 02:47:13,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2071 transitions. [2024-11-17 02:47:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 02:47:13,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:13,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:13,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 02:47:13,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:13,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:13,585 INFO L85 PathProgramCache]: Analyzing trace with hash 63560258, now seen corresponding path program 1 times [2024-11-17 02:47:13,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:13,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606280291] [2024-11-17 02:47:13,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:13,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:13,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606280291] [2024-11-17 02:47:13,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606280291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:13,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:13,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:47:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827578050] [2024-11-17 02:47:13,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:13,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:47:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:13,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:47:13,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:47:13,662 INFO L87 Difference]: Start difference. First operand 1529 states and 2071 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:13,962 INFO L93 Difference]: Finished difference Result 2737 states and 3633 transitions. [2024-11-17 02:47:13,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:47:13,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 02:47:13,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:13,975 INFO L225 Difference]: With dead ends: 2737 [2024-11-17 02:47:13,976 INFO L226 Difference]: Without dead ends: 2737 [2024-11-17 02:47:13,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:47:13,979 INFO L432 NwaCegarLoop]: 1319 mSDtfsCounter, 1116 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:13,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 3705 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:47:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2024-11-17 02:47:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 1532. [2024-11-17 02:47:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1183 states have (on average 1.7261200338123415) internal successors, (2042), 1523 states have internal predecessors, (2042), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 02:47:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2074 transitions. [2024-11-17 02:47:14,025 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2074 transitions. Word has length 13 [2024-11-17 02:47:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:14,026 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 2074 transitions. [2024-11-17 02:47:14,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2074 transitions. [2024-11-17 02:47:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 02:47:14,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:14,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:14,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 02:47:14,027 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:14,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1457343219, now seen corresponding path program 1 times [2024-11-17 02:47:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625226424] [2024-11-17 02:47:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:14,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:14,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625226424] [2024-11-17 02:47:14,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625226424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:14,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:14,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:47:14,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587846154] [2024-11-17 02:47:14,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:14,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:47:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:14,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:47:14,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:47:14,111 INFO L87 Difference]: Start difference. First operand 1532 states and 2074 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:14,827 INFO L93 Difference]: Finished difference Result 1607 states and 2180 transitions. [2024-11-17 02:47:14,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:47:14,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 02:47:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:14,835 INFO L225 Difference]: With dead ends: 1607 [2024-11-17 02:47:14,835 INFO L226 Difference]: Without dead ends: 1607 [2024-11-17 02:47:14,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:47:14,838 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 1368 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:14,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1322 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:47:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-17 02:47:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1509. [2024-11-17 02:47:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1183 states have (on average 1.687235841081995) internal successors, (1996), 1500 states have internal predecessors, (1996), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 02:47:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2028 transitions. [2024-11-17 02:47:14,872 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2028 transitions. Word has length 20 [2024-11-17 02:47:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:14,873 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2028 transitions. [2024-11-17 02:47:14,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2028 transitions. [2024-11-17 02:47:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 02:47:14,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:14,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:14,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 02:47:14,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:14,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1457343218, now seen corresponding path program 1 times [2024-11-17 02:47:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596959667] [2024-11-17 02:47:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:14,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:14,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:14,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596959667] [2024-11-17 02:47:14,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596959667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:14,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:14,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:47:14,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873577550] [2024-11-17 02:47:14,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:14,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:47:14,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:14,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:47:14,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:14,973 INFO L87 Difference]: Start difference. First operand 1509 states and 2028 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:15,049 INFO L93 Difference]: Finished difference Result 1371 states and 1822 transitions. [2024-11-17 02:47:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:47:15,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 02:47:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:15,054 INFO L225 Difference]: With dead ends: 1371 [2024-11-17 02:47:15,054 INFO L226 Difference]: Without dead ends: 1371 [2024-11-17 02:47:15,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:15,055 INFO L432 NwaCegarLoop]: 1000 mSDtfsCounter, 61 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:15,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1946 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:47:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2024-11-17 02:47:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2024-11-17 02:47:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1057 states have (on average 1.6934720908230843) internal successors, (1790), 1362 states have internal predecessors, (1790), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 02:47:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1822 transitions. [2024-11-17 02:47:15,085 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1822 transitions. Word has length 20 [2024-11-17 02:47:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:15,085 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1822 transitions. [2024-11-17 02:47:15,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1822 transitions. [2024-11-17 02:47:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 02:47:15,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:15,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:15,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 02:47:15,087 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:15,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash -347605167, now seen corresponding path program 1 times [2024-11-17 02:47:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:15,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964147777] [2024-11-17 02:47:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:15,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:15,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964147777] [2024-11-17 02:47:15,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964147777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:15,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:15,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:47:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249144247] [2024-11-17 02:47:15,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:15,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:47:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:15,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:47:15,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:47:15,165 INFO L87 Difference]: Start difference. First operand 1371 states and 1822 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:15,276 INFO L93 Difference]: Finished difference Result 1342 states and 1772 transitions. [2024-11-17 02:47:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:47:15,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 02:47:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:15,282 INFO L225 Difference]: With dead ends: 1342 [2024-11-17 02:47:15,282 INFO L226 Difference]: Without dead ends: 1342 [2024-11-17 02:47:15,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:47:15,283 INFO L432 NwaCegarLoop]: 965 mSDtfsCounter, 41 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:15,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2866 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:47:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-11-17 02:47:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1336. [2024-11-17 02:47:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1029 states have (on average 1.685131195335277) internal successors, (1734), 1327 states have internal predecessors, (1734), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 02:47:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1766 transitions. [2024-11-17 02:47:15,308 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1766 transitions. Word has length 22 [2024-11-17 02:47:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:15,308 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1766 transitions. [2024-11-17 02:47:15,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1766 transitions. [2024-11-17 02:47:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 02:47:15,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:15,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:15,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 02:47:15,310 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:15,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash 341081511, now seen corresponding path program 1 times [2024-11-17 02:47:15,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:15,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99186237] [2024-11-17 02:47:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99186237] [2024-11-17 02:47:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99186237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:15,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:15,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:47:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290429003] [2024-11-17 02:47:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:15,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:47:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:15,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:47:15,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:47:15,458 INFO L87 Difference]: Start difference. First operand 1336 states and 1766 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:16,319 INFO L93 Difference]: Finished difference Result 2151 states and 2936 transitions. [2024-11-17 02:47:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:47:16,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-17 02:47:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:16,326 INFO L225 Difference]: With dead ends: 2151 [2024-11-17 02:47:16,327 INFO L226 Difference]: Without dead ends: 2151 [2024-11-17 02:47:16,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:47:16,328 INFO L432 NwaCegarLoop]: 804 mSDtfsCounter, 841 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:16,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1886 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:47:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2024-11-17 02:47:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1332. [2024-11-17 02:47:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1029 states have (on average 1.6773566569484937) internal successors, (1726), 1323 states have internal predecessors, (1726), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 02:47:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1758 transitions. [2024-11-17 02:47:16,359 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1758 transitions. Word has length 36 [2024-11-17 02:47:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:16,359 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1758 transitions. [2024-11-17 02:47:16,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1758 transitions. [2024-11-17 02:47:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-17 02:47:16,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:16,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:16,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 02:47:16,361 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:16,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1838242583, now seen corresponding path program 1 times [2024-11-17 02:47:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389822216] [2024-11-17 02:47:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:16,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389822216] [2024-11-17 02:47:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389822216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:16,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:16,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:47:16,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388529635] [2024-11-17 02:47:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:47:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:16,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:47:16,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:47:16,481 INFO L87 Difference]: Start difference. First operand 1332 states and 1758 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:16,597 INFO L93 Difference]: Finished difference Result 1332 states and 1750 transitions. [2024-11-17 02:47:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:47:16,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-17 02:47:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:16,604 INFO L225 Difference]: With dead ends: 1332 [2024-11-17 02:47:16,604 INFO L226 Difference]: Without dead ends: 1332 [2024-11-17 02:47:16,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:47:16,605 INFO L432 NwaCegarLoop]: 960 mSDtfsCounter, 21 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:16,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2848 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:47:16,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2024-11-17 02:47:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2024-11-17 02:47:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1029 states have (on average 1.6695821185617103) internal successors, (1718), 1323 states have internal predecessors, (1718), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 02:47:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1750 transitions. [2024-11-17 02:47:16,628 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1750 transitions. Word has length 71 [2024-11-17 02:47:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:16,629 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1750 transitions. [2024-11-17 02:47:16,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1750 transitions. [2024-11-17 02:47:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-17 02:47:16,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:16,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:16,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 02:47:16,634 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:16,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash 857820833, now seen corresponding path program 1 times [2024-11-17 02:47:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:16,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828240321] [2024-11-17 02:47:16,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828240321] [2024-11-17 02:47:16,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828240321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:16,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:16,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:47:16,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471051953] [2024-11-17 02:47:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:16,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:47:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:16,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:47:16,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:16,771 INFO L87 Difference]: Start difference. First operand 1332 states and 1750 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:16,938 INFO L93 Difference]: Finished difference Result 1869 states and 2519 transitions. [2024-11-17 02:47:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:47:16,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-17 02:47:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:16,945 INFO L225 Difference]: With dead ends: 1869 [2024-11-17 02:47:16,945 INFO L226 Difference]: Without dead ends: 1869 [2024-11-17 02:47:16,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:47:16,946 INFO L432 NwaCegarLoop]: 1242 mSDtfsCounter, 367 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:16,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 2172 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:47:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2024-11-17 02:47:16,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1811. [2024-11-17 02:47:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1498 states have (on average 1.644192256341789) internal successors, (2463), 1802 states have internal predecessors, (2463), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-17 02:47:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2515 transitions. [2024-11-17 02:47:16,977 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2515 transitions. Word has length 79 [2024-11-17 02:47:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:16,978 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2515 transitions. [2024-11-17 02:47:16,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2515 transitions. [2024-11-17 02:47:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 02:47:16,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:16,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:16,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 02:47:16,979 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:16,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1385662764, now seen corresponding path program 1 times [2024-11-17 02:47:16,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:16,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930731559] [2024-11-17 02:47:16,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:16,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:17,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:17,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930731559] [2024-11-17 02:47:17,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930731559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:17,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:17,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:47:17,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599203670] [2024-11-17 02:47:17,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:17,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:47:17,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:17,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:47:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:47:17,256 INFO L87 Difference]: Start difference. First operand 1811 states and 2515 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:17,954 INFO L93 Difference]: Finished difference Result 1810 states and 2513 transitions. [2024-11-17 02:47:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:47:17,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-17 02:47:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:17,961 INFO L225 Difference]: With dead ends: 1810 [2024-11-17 02:47:17,962 INFO L226 Difference]: Without dead ends: 1810 [2024-11-17 02:47:17,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:47:17,963 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 2 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:17,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2890 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:47:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-17 02:47:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2024-11-17 02:47:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1498 states have (on average 1.6428571428571428) internal successors, (2461), 1801 states have internal predecessors, (2461), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-17 02:47:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2513 transitions. [2024-11-17 02:47:18,002 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2513 transitions. Word has length 87 [2024-11-17 02:47:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:18,003 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2513 transitions. [2024-11-17 02:47:18,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2513 transitions. [2024-11-17 02:47:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 02:47:18,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:18,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:18,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 02:47:18,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:18,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:18,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1385662765, now seen corresponding path program 1 times [2024-11-17 02:47:18,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:18,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840139967] [2024-11-17 02:47:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:18,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:18,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:18,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840139967] [2024-11-17 02:47:18,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840139967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:18,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:18,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:47:18,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211148144] [2024-11-17 02:47:18,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:18,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:47:18,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:18,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:47:18,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:47:18,451 INFO L87 Difference]: Start difference. First operand 1810 states and 2513 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:19,301 INFO L93 Difference]: Finished difference Result 1809 states and 2511 transitions. [2024-11-17 02:47:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:47:19,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-17 02:47:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:19,309 INFO L225 Difference]: With dead ends: 1809 [2024-11-17 02:47:19,309 INFO L226 Difference]: Without dead ends: 1809 [2024-11-17 02:47:19,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:47:19,310 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 1 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:19,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2831 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:47:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-17 02:47:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2024-11-17 02:47:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1496 states have (on average 1.643716577540107) internal successors, (2459), 1800 states have internal predecessors, (2459), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-17 02:47:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2511 transitions. [2024-11-17 02:47:19,349 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2511 transitions. Word has length 87 [2024-11-17 02:47:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:19,350 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2511 transitions. [2024-11-17 02:47:19,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:47:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2511 transitions. [2024-11-17 02:47:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:47:19,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:19,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:19,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 02:47:19,354 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:19,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:19,355 INFO L85 PathProgramCache]: Analyzing trace with hash 404855753, now seen corresponding path program 1 times [2024-11-17 02:47:19,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:19,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154641861] [2024-11-17 02:47:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:19,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:19,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154641861] [2024-11-17 02:47:19,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154641861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:19,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:19,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:47:19,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818680535] [2024-11-17 02:47:19,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:19,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:47:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:19,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:47:19,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:47:19,700 INFO L87 Difference]: Start difference. First operand 1809 states and 2511 transitions. Second operand has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:20,736 INFO L93 Difference]: Finished difference Result 1827 states and 2537 transitions. [2024-11-17 02:47:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 02:47:20,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-17 02:47:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:20,744 INFO L225 Difference]: With dead ends: 1827 [2024-11-17 02:47:20,744 INFO L226 Difference]: Without dead ends: 1827 [2024-11-17 02:47:20,745 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-17 02:47:20,745 INFO L432 NwaCegarLoop]: 956 mSDtfsCounter, 17 mSDsluCounter, 3476 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4432 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:20,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4432 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:47:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2024-11-17 02:47:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1818. [2024-11-17 02:47:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1504 states have (on average 1.6422872340425532) internal successors, (2470), 1807 states have internal predecessors, (2470), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-17 02:47:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2527 transitions. [2024-11-17 02:47:20,778 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2527 transitions. Word has length 95 [2024-11-17 02:47:20,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:20,779 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2527 transitions. [2024-11-17 02:47:20,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2527 transitions. [2024-11-17 02:47:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:47:20,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:20,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:20,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 02:47:20,781 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:20,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash 404855754, now seen corresponding path program 1 times [2024-11-17 02:47:20,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:20,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174408808] [2024-11-17 02:47:20,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:20,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:21,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:21,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174408808] [2024-11-17 02:47:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174408808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:21,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:21,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:47:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234838379] [2024-11-17 02:47:21,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:21,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:47:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:21,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:47:21,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:47:21,399 INFO L87 Difference]: Start difference. First operand 1818 states and 2527 transitions. Second operand has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:22,634 INFO L93 Difference]: Finished difference Result 1818 states and 2525 transitions. [2024-11-17 02:47:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:47:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-17 02:47:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:22,646 INFO L225 Difference]: With dead ends: 1818 [2024-11-17 02:47:22,649 INFO L226 Difference]: Without dead ends: 1818 [2024-11-17 02:47:22,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:47:22,650 INFO L432 NwaCegarLoop]: 960 mSDtfsCounter, 12 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:22,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4415 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 02:47:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2024-11-17 02:47:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1818. [2024-11-17 02:47:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1504 states have (on average 1.6409574468085106) internal successors, (2468), 1807 states have internal predecessors, (2468), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-17 02:47:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2525 transitions. [2024-11-17 02:47:22,690 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2525 transitions. Word has length 95 [2024-11-17 02:47:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:22,690 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2525 transitions. [2024-11-17 02:47:22,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2525 transitions. [2024-11-17 02:47:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 02:47:22,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:22,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:22,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 02:47:22,692 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:22,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1720374036, now seen corresponding path program 1 times [2024-11-17 02:47:22,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:22,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196890531] [2024-11-17 02:47:22,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:22,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:23,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:23,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196890531] [2024-11-17 02:47:23,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196890531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:23,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147500594] [2024-11-17 02:47:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:23,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:23,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:23,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:47:23,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 02:47:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:23,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-17 02:47:23,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:23,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:47:23,727 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:47:23,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 02:47:23,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:47:23,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 02:47:24,009 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:24,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:47:24,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:47:24,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-17 02:47:24,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:24,134 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_592) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-17 02:47:24,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147500594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:24,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:24,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-17 02:47:24,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595707332] [2024-11-17 02:47:24,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:24,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 02:47:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:24,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 02:47:24,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-17 02:47:24,138 INFO L87 Difference]: Start difference. First operand 1818 states and 2525 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:47:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:27,236 INFO L93 Difference]: Finished difference Result 1825 states and 2531 transitions. [2024-11-17 02:47:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:47:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-17 02:47:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:27,242 INFO L225 Difference]: With dead ends: 1825 [2024-11-17 02:47:27,242 INFO L226 Difference]: Without dead ends: 1825 [2024-11-17 02:47:27,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2024-11-17 02:47:27,243 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 907 mSDsluCounter, 7221 mSDsCounter, 0 mSdLazyCounter, 5179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 7844 SdHoareTripleChecker+Invalid, 5201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:27,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 7844 Invalid, 5201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5179 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-17 02:47:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-17 02:47:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1822. [2024-11-17 02:47:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1508 states have (on average 1.6385941644562334) internal successors, (2471), 1810 states have internal predecessors, (2471), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-17 02:47:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2525 transitions. [2024-11-17 02:47:27,280 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2525 transitions. Word has length 96 [2024-11-17 02:47:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:27,281 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2525 transitions. [2024-11-17 02:47:27,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:47:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2525 transitions. [2024-11-17 02:47:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 02:47:27,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:27,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:27,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 02:47:27,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 02:47:27,487 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:27,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1720374037, now seen corresponding path program 1 times [2024-11-17 02:47:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:27,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918904546] [2024-11-17 02:47:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:28,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:28,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918904546] [2024-11-17 02:47:28,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918904546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070493113] [2024-11-17 02:47:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:28,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:28,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:28,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:47:28,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 02:47:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:28,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-17 02:47:28,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:28,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:47:28,763 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:47:28,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:47:28,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 02:47:28,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:47:28,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 02:47:28,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 22 treesize of output 10 [2024-11-17 02:47:28,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:47:29,017 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:29,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-17 02:47:29,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:47:29,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:47:29,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:47:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:29,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:29,195 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_741 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-17 02:47:29,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070493113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:29,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:29,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-17 02:47:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518393126] [2024-11-17 02:47:29,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:29,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 02:47:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:29,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 02:47:29,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-17 02:47:29,200 INFO L87 Difference]: Start difference. First operand 1822 states and 2525 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:47:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:32,322 INFO L93 Difference]: Finished difference Result 1824 states and 2529 transitions. [2024-11-17 02:47:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:47:32,323 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-17 02:47:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:32,328 INFO L225 Difference]: With dead ends: 1824 [2024-11-17 02:47:32,328 INFO L226 Difference]: Without dead ends: 1824 [2024-11-17 02:47:32,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-17 02:47:32,329 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 905 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 5680 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 6347 SdHoareTripleChecker+Invalid, 5703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:32,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 6347 Invalid, 5703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5680 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-17 02:47:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2024-11-17 02:47:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1812. [2024-11-17 02:47:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1500 states have (on average 1.64) internal successors, (2460), 1802 states have internal predecessors, (2460), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-17 02:47:32,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2512 transitions. [2024-11-17 02:47:32,359 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2512 transitions. Word has length 96 [2024-11-17 02:47:32,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:32,359 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2512 transitions. [2024-11-17 02:47:32,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:47:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2512 transitions. [2024-11-17 02:47:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 02:47:32,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:32,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:32,381 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-17 02:47:32,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-17 02:47:32,567 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:32,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:32,568 INFO L85 PathProgramCache]: Analyzing trace with hash 790489874, now seen corresponding path program 1 times [2024-11-17 02:47:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:32,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331466743] [2024-11-17 02:47:32,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:33,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:33,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331466743] [2024-11-17 02:47:33,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331466743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:33,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:33,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:47:33,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052425130] [2024-11-17 02:47:33,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:33,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:47:33,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:33,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:47:33,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:47:33,167 INFO L87 Difference]: Start difference. First operand 1812 states and 2512 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:34,786 INFO L93 Difference]: Finished difference Result 1831 states and 2537 transitions. [2024-11-17 02:47:34,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:47:34,786 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-17 02:47:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:34,790 INFO L225 Difference]: With dead ends: 1831 [2024-11-17 02:47:34,791 INFO L226 Difference]: Without dead ends: 1831 [2024-11-17 02:47:34,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-17 02:47:34,792 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 940 mSDsluCounter, 4818 mSDsCounter, 0 mSdLazyCounter, 3629 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 5441 SdHoareTripleChecker+Invalid, 3648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:34,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 5441 Invalid, 3648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3629 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:47:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2024-11-17 02:47:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1827. [2024-11-17 02:47:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1514 states have (on average 1.6360634081902246) internal successors, (2477), 1815 states have internal predecessors, (2477), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-17 02:47:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2531 transitions. [2024-11-17 02:47:34,818 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2531 transitions. Word has length 98 [2024-11-17 02:47:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:34,818 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2531 transitions. [2024-11-17 02:47:34,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2531 transitions. [2024-11-17 02:47:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 02:47:34,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:34,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:34,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 02:47:34,820 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:34,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash 790489875, now seen corresponding path program 1 times [2024-11-17 02:47:34,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:34,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6683489] [2024-11-17 02:47:34,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:34,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:35,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:35,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:35,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6683489] [2024-11-17 02:47:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6683489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:35,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:35,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 02:47:35,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637252081] [2024-11-17 02:47:35,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:35,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 02:47:35,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:35,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 02:47:35,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-17 02:47:35,584 INFO L87 Difference]: Start difference. First operand 1827 states and 2531 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:37,361 INFO L93 Difference]: Finished difference Result 1830 states and 2535 transitions. [2024-11-17 02:47:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 02:47:37,361 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-17 02:47:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:37,365 INFO L225 Difference]: With dead ends: 1830 [2024-11-17 02:47:37,365 INFO L226 Difference]: Without dead ends: 1830 [2024-11-17 02:47:37,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:47:37,366 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 914 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:37,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 3862 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:47:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2024-11-17 02:47:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1827. [2024-11-17 02:47:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1514 states have (on average 1.6347424042272127) internal successors, (2475), 1815 states have internal predecessors, (2475), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-17 02:47:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2529 transitions. [2024-11-17 02:47:37,393 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2529 transitions. Word has length 98 [2024-11-17 02:47:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:37,393 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2529 transitions. [2024-11-17 02:47:37,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2529 transitions. [2024-11-17 02:47:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:47:37,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:37,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 02:47:37,395 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:37,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash -180917273, now seen corresponding path program 1 times [2024-11-17 02:47:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887540030] [2024-11-17 02:47:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:38,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:38,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887540030] [2024-11-17 02:47:38,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887540030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:38,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855254547] [2024-11-17 02:47:38,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:38,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:38,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:38,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:47:38,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 02:47:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:38,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 02:47:38,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:38,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:47:38,422 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:47:38,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 02:47:38,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:47:38,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 02:47:38,683 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:38,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:47:38,782 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:38,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:47:38,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:47:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:38,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:38,845 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-17 02:47:38,852 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 02:47:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855254547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:38,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-17 02:47:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870970771] [2024-11-17 02:47:38,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:38,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 02:47:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:38,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 02:47:38,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=419, Unknown=20, NotChecked=86, Total=600 [2024-11-17 02:47:38,930 INFO L87 Difference]: Start difference. First operand 1827 states and 2529 transitions. Second operand has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:47:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:41,180 INFO L93 Difference]: Finished difference Result 1829 states and 2533 transitions. [2024-11-17 02:47:41,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:47:41,181 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-17 02:47:41,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:41,185 INFO L225 Difference]: With dead ends: 1829 [2024-11-17 02:47:41,186 INFO L226 Difference]: Without dead ends: 1829 [2024-11-17 02:47:41,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=586, Unknown=22, NotChecked=102, Total=812 [2024-11-17 02:47:41,186 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 902 mSDsluCounter, 6571 mSDsCounter, 0 mSdLazyCounter, 4736 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 7193 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:41,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 7193 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4736 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-17 02:47:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2024-11-17 02:47:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1826. [2024-11-17 02:47:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1514 states have (on average 1.6334214002642007) internal successors, (2473), 1814 states have internal predecessors, (2473), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-17 02:47:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2527 transitions. [2024-11-17 02:47:41,221 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2527 transitions. Word has length 99 [2024-11-17 02:47:41,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:41,221 INFO L471 AbstractCegarLoop]: Abstraction has 1826 states and 2527 transitions. [2024-11-17 02:47:41,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:47:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2527 transitions. [2024-11-17 02:47:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:47:41,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:41,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:41,244 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-17 02:47:41,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:41,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:41,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:41,425 INFO L85 PathProgramCache]: Analyzing trace with hash -180917272, now seen corresponding path program 1 times [2024-11-17 02:47:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:41,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859106620] [2024-11-17 02:47:41,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:41,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:42,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:42,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859106620] [2024-11-17 02:47:42,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859106620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:42,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533537696] [2024-11-17 02:47:42,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:42,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:42,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:42,306 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:47:42,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 02:47:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:42,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 02:47:42,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:42,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:47:42,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 02:47:42,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:47:42,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:47:42,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 02:47:42,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:47:42,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 02:47:42,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:47:42,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:42,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-17 02:47:42,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:47:43,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:43,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-17 02:47:43,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:47:43,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:47:43,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:47:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:43,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:43,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1189 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:47:43,143 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1189 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-17 02:47:43,196 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1195) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1196))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1195) .cse1 v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-17 02:47:43,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533537696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:43,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:43,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-17 02:47:43,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773339409] [2024-11-17 02:47:43,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:43,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 02:47:43,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:43,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 02:47:43,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=438, Unknown=3, NotChecked=132, Total=650 [2024-11-17 02:47:43,201 INFO L87 Difference]: Start difference. First operand 1826 states and 2527 transitions. Second operand has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:47:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:46,316 INFO L93 Difference]: Finished difference Result 1828 states and 2531 transitions. [2024-11-17 02:47:46,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:47:46,317 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-17 02:47:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:46,320 INFO L225 Difference]: With dead ends: 1828 [2024-11-17 02:47:46,321 INFO L226 Difference]: Without dead ends: 1828 [2024-11-17 02:47:46,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=694, Unknown=3, NotChecked=168, Total=992 [2024-11-17 02:47:46,322 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 902 mSDsluCounter, 6649 mSDsCounter, 0 mSdLazyCounter, 6773 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 6796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:46,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 7274 Invalid, 6796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6773 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-17 02:47:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2024-11-17 02:47:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1810. [2024-11-17 02:47:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1500 states have (on average 1.6373333333333333) internal successors, (2456), 1800 states have internal predecessors, (2456), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-17 02:47:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2508 transitions. [2024-11-17 02:47:46,358 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2508 transitions. Word has length 99 [2024-11-17 02:47:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:46,358 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2508 transitions. [2024-11-17 02:47:46,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:47:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2508 transitions. [2024-11-17 02:47:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 02:47:46,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:46,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:46,379 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-17 02:47:46,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:46,561 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:46,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash 179064834, now seen corresponding path program 1 times [2024-11-17 02:47:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845038245] [2024-11-17 02:47:46,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:46,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:47,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:47,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845038245] [2024-11-17 02:47:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845038245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:47,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:47,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 02:47:47,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036802782] [2024-11-17 02:47:47,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:47,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:47:47,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:47,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:47:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-17 02:47:47,200 INFO L87 Difference]: Start difference. First operand 1810 states and 2508 transitions. Second operand has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:49,374 INFO L93 Difference]: Finished difference Result 1835 states and 2539 transitions. [2024-11-17 02:47:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:47:49,377 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-17 02:47:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:49,384 INFO L225 Difference]: With dead ends: 1835 [2024-11-17 02:47:49,384 INFO L226 Difference]: Without dead ends: 1835 [2024-11-17 02:47:49,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-17 02:47:49,385 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 935 mSDsluCounter, 6018 mSDsCounter, 0 mSdLazyCounter, 4420 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 6640 SdHoareTripleChecker+Invalid, 4438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:49,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 6640 Invalid, 4438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4420 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 02:47:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-11-17 02:47:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1831. [2024-11-17 02:47:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1520 states have (on average 1.630921052631579) internal successors, (2479), 1819 states have internal predecessors, (2479), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-17 02:47:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2533 transitions. [2024-11-17 02:47:49,410 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2533 transitions. Word has length 101 [2024-11-17 02:47:49,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:49,410 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2533 transitions. [2024-11-17 02:47:49,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2533 transitions. [2024-11-17 02:47:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 02:47:49,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:49,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:49,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 02:47:49,413 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:49,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash 179064835, now seen corresponding path program 1 times [2024-11-17 02:47:49,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:49,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197899859] [2024-11-17 02:47:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:49,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:50,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:50,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197899859] [2024-11-17 02:47:50,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197899859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:50,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:50,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 02:47:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728794159] [2024-11-17 02:47:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:50,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 02:47:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:50,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 02:47:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-17 02:47:50,242 INFO L87 Difference]: Start difference. First operand 1831 states and 2533 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:51,915 INFO L93 Difference]: Finished difference Result 1834 states and 2537 transitions. [2024-11-17 02:47:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:47:51,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-17 02:47:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:51,920 INFO L225 Difference]: With dead ends: 1834 [2024-11-17 02:47:51,920 INFO L226 Difference]: Without dead ends: 1834 [2024-11-17 02:47:51,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-17 02:47:51,921 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 940 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 3321 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:51,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 3726 Invalid, 3347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3321 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:47:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2024-11-17 02:47:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1831. [2024-11-17 02:47:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1520 states have (on average 1.6296052631578948) internal successors, (2477), 1819 states have internal predecessors, (2477), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-17 02:47:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2531 transitions. [2024-11-17 02:47:51,947 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2531 transitions. Word has length 101 [2024-11-17 02:47:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:51,947 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2531 transitions. [2024-11-17 02:47:51,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2531 transitions. [2024-11-17 02:47:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:47:51,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:51,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:51,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 02:47:51,949 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:51,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:51,950 INFO L85 PathProgramCache]: Analyzing trace with hash 478389005, now seen corresponding path program 1 times [2024-11-17 02:47:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058324876] [2024-11-17 02:47:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:52,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:52,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:52,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058324876] [2024-11-17 02:47:52,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058324876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:52,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935899480] [2024-11-17 02:47:52,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:52,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:52,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:52,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:47:52,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 02:47:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:52,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 02:47:52,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:52,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:47:53,019 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:47:53,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:47:53,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:47:53,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:53,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-17 02:47:53,115 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:53,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-17 02:47:53,153 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:53,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:47:53,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:47:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:53,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:53,183 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-17 02:47:53,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-17 02:47:53,284 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1510 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1510) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-17 02:47:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935899480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:53,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:53,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2024-11-17 02:47:53,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365853610] [2024-11-17 02:47:53,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:53,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 02:47:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:53,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 02:47:53,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=387, Unknown=15, NotChecked=40, Total=506 [2024-11-17 02:47:53,287 INFO L87 Difference]: Start difference. First operand 1831 states and 2531 transitions. Second operand has 20 states, 18 states have (on average 8.666666666666666) internal successors, (156), 19 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:47:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:55,132 INFO L93 Difference]: Finished difference Result 1833 states and 2535 transitions. [2024-11-17 02:47:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:47:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.666666666666666) internal successors, (156), 19 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-11-17 02:47:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:55,138 INFO L225 Difference]: With dead ends: 1833 [2024-11-17 02:47:55,138 INFO L226 Difference]: Without dead ends: 1833 [2024-11-17 02:47:55,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=784, Unknown=17, NotChecked=58, Total=992 [2024-11-17 02:47:55,139 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 904 mSDsluCounter, 6009 mSDsCounter, 0 mSdLazyCounter, 4412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 6631 SdHoareTripleChecker+Invalid, 4440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:55,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 6631 Invalid, 4440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4412 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:47:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2024-11-17 02:47:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1830. [2024-11-17 02:47:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1520 states have (on average 1.6282894736842106) internal successors, (2475), 1818 states have internal predecessors, (2475), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-17 02:47:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2529 transitions. [2024-11-17 02:47:55,161 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2529 transitions. Word has length 102 [2024-11-17 02:47:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:55,162 INFO L471 AbstractCegarLoop]: Abstraction has 1830 states and 2529 transitions. [2024-11-17 02:47:55,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.666666666666666) internal successors, (156), 19 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:47:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2529 transitions. [2024-11-17 02:47:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:47:55,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:55,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:55,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 02:47:55,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-17 02:47:55,368 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:47:55,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash 478389006, now seen corresponding path program 1 times [2024-11-17 02:47:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031816865] [2024-11-17 02:47:55,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:55,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:56,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:47:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:56,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031816865] [2024-11-17 02:47:56,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031816865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105821776] [2024-11-17 02:47:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:56,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:56,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:56,359 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:47:56,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 02:47:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:56,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 02:47:56,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:56,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:47:56,696 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:47:56,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 02:47:56,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 02:47:56,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:47:56,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 02:47:56,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 02:47:56,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:47:56,885 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:56,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-17 02:47:56,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:47:56,954 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:56,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-17 02:47:56,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:47:57,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:57,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-17 02:47:57,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:47:57,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:47:57,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:47:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:47:57,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:57,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1681 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:47:57,098 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1681 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-17 02:47:57,115 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1680))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1679) .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-17 02:47:57,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1688))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1687) .cse0 v_ArrVal_1679) (select (select (store .cse1 .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1681))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1688))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1680))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1687) .cse3 v_ArrVal_1679) .cse4 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-17 02:47:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105821776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:57,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:57,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2024-11-17 02:47:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334479153] [2024-11-17 02:47:57,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:57,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-17 02:47:57,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:57,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-17 02:47:57,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=559, Unknown=9, NotChecked=204, Total=870 [2024-11-17 02:47:57,237 INFO L87 Difference]: Start difference. First operand 1830 states and 2529 transitions. Second operand has 23 states, 20 states have (on average 8.15) internal successors, (163), 22 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:48:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:48:00,849 INFO L93 Difference]: Finished difference Result 1832 states and 2533 transitions. [2024-11-17 02:48:00,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:48:00,850 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.15) internal successors, (163), 22 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2024-11-17 02:48:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:48:00,853 INFO L225 Difference]: With dead ends: 1832 [2024-11-17 02:48:00,853 INFO L226 Difference]: Without dead ends: 1832 [2024-11-17 02:48:00,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=900, Unknown=9, NotChecked=260, Total=1332 [2024-11-17 02:48:00,854 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 899 mSDsluCounter, 7624 mSDsCounter, 0 mSdLazyCounter, 7779 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 8248 SdHoareTripleChecker+Invalid, 7802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:48:00,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 8248 Invalid, 7802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 7779 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-17 02:48:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-17 02:48:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1808. [2024-11-17 02:48:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1500 states have (on average 1.6346666666666667) internal successors, (2452), 1798 states have internal predecessors, (2452), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-17 02:48:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2504 transitions. [2024-11-17 02:48:00,879 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2504 transitions. Word has length 102 [2024-11-17 02:48:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:48:00,880 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2504 transitions. [2024-11-17 02:48:00,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.15) internal successors, (163), 22 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:48:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2504 transitions. [2024-11-17 02:48:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-17 02:48:00,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:48:00,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:48:00,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-17 02:48:01,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:48:01,082 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:48:01,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:48:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash 171993579, now seen corresponding path program 1 times [2024-11-17 02:48:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:48:01,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129855255] [2024-11-17 02:48:01,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:48:01,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:48:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:48:01,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:48:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:48:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:48:01,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:48:01,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129855255] [2024-11-17 02:48:01,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129855255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:48:01,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:48:01,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-17 02:48:01,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490090069] [2024-11-17 02:48:01,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:48:01,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 02:48:01,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:48:01,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 02:48:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:48:01,765 INFO L87 Difference]: Start difference. First operand 1808 states and 2504 transitions. Second operand has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:48:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:48:03,982 INFO L93 Difference]: Finished difference Result 1839 states and 2541 transitions. [2024-11-17 02:48:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:48:03,982 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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 104 [2024-11-17 02:48:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:48:03,985 INFO L225 Difference]: With dead ends: 1839 [2024-11-17 02:48:03,985 INFO L226 Difference]: Without dead ends: 1839 [2024-11-17 02:48:03,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-17 02:48:03,985 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 917 mSDsluCounter, 7174 mSDsCounter, 0 mSdLazyCounter, 5221 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 7795 SdHoareTripleChecker+Invalid, 5239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:48:03,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 7795 Invalid, 5239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5221 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 02:48:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2024-11-17 02:48:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1835. [2024-11-17 02:48:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1526 states have (on average 1.625819134993447) internal successors, (2481), 1823 states have internal predecessors, (2481), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-17 02:48:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2535 transitions. [2024-11-17 02:48:04,009 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2535 transitions. Word has length 104 [2024-11-17 02:48:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:48:04,009 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2535 transitions. [2024-11-17 02:48:04,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:48:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2535 transitions. [2024-11-17 02:48:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-17 02:48:04,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:48:04,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:48:04,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 02:48:04,011 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:48:04,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:48:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash 171993580, now seen corresponding path program 1 times [2024-11-17 02:48:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:48:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884874342] [2024-11-17 02:48:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:48:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:48:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:48:04,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:48:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:48:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:48:04,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:48:04,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884874342] [2024-11-17 02:48:04,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884874342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:48:04,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:48:04,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:48:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903641958] [2024-11-17 02:48:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:48:04,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:48:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:48:04,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:48:04,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:48:04,888 INFO L87 Difference]: Start difference. First operand 1835 states and 2535 transitions. Second operand has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:48:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:48:06,490 INFO L93 Difference]: Finished difference Result 1838 states and 2539 transitions. [2024-11-17 02:48:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 02:48:06,491 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 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 104 [2024-11-17 02:48:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:48:06,496 INFO L225 Difference]: With dead ends: 1838 [2024-11-17 02:48:06,496 INFO L226 Difference]: Without dead ends: 1838 [2024-11-17 02:48:06,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-17 02:48:06,497 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 939 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 3330 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 3733 SdHoareTripleChecker+Invalid, 3356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:48:06,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 3733 Invalid, 3356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3330 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:48:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-17 02:48:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1835. [2024-11-17 02:48:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1526 states have (on average 1.624508519003932) internal successors, (2479), 1823 states have internal predecessors, (2479), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-17 02:48:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2533 transitions. [2024-11-17 02:48:06,521 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2533 transitions. Word has length 104 [2024-11-17 02:48:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:48:06,521 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2533 transitions. [2024-11-17 02:48:06,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:48:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2533 transitions. [2024-11-17 02:48:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 02:48:06,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:48:06,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:48:06,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 02:48:06,523 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-17 02:48:06,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:48:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash 986265344, now seen corresponding path program 1 times [2024-11-17 02:48:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:48:06,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992070574] [2024-11-17 02:48:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:48:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:48:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:48:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-17 02:48:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:48:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:48:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:48:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992070574] [2024-11-17 02:48:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992070574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:48:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214352628] [2024-11-17 02:48:07,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:48:07,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:48:07,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:48:07,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:48:07,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 02:48:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:48:07,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 02:48:07,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:48:07,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:48:07,631 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:48:07,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 02:48:07,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:48:07,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 02:48:07,856 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:48:07,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:48:07,921 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:48:07,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:48:07,977 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:48:07,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:48:08,021 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:48:08,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:48:08,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:48:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:48:08,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:48:08,202 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2024))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2025)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:48:12,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2028))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2023)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2024)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2025)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:48:12,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214352628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:48:12,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:48:12,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-17 02:48:12,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957241211] [2024-11-17 02:48:12,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:48:12,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:48:12,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:48:12,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:48:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=734, Unknown=74, NotChecked=118, Total=1056 [2024-11-17 02:48:12,448 INFO L87 Difference]: Start difference. First operand 1835 states and 2533 transitions. Second operand has 26 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 25 states have internal predecessors, (169), 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)